English
Related papers

Related papers: Effective inseparability, lattices, and pre-orderi…

200 papers

For two causal structures with the same set of visible variables, one is said to observationally dominate the other if the set of distributions over the visible variables realizable by the first contains the set of distributions over the…

Machine Learning · Statistics 2025-02-24 Marina Maciel Ansanelli , Elie Wolfe , Robert W. Spekkens

Measure and integral are two closely related, but distinct objects of study. Nonetheless, they are both real-valued lattice valuations: order preserving real-valued functions $\phi$ on a lattice $L$ which are modular, i.e.,…

Functional Analysis · Mathematics 2019-03-15 Abraham A. Westerbaan

A residuated lattice is defined to be integrally closed if it satisfies the equations x\x = e and x/x = e. Every integral, cancellative, or divisible residuated lattice is integrally closed, and, conversely, every bounded integrally closed…

Logic · Mathematics 2019-11-18 José Gil-Férez , Frederik Lauridsen , George Metcalfe

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

Logic · Mathematics 2022-07-19 Deacon Linkhorn

A unital $\ell$-group $(G,u)$ is an abelian group $G$ equipped with a translation-invariant lattice-order and a distinguished element $u$, called order-unit, whose positive integer multiples eventually dominate each element of $G$. We…

Group Theory · Mathematics 2009-08-18 Manuela Busaniche , Leonardo Cabrer , Daniele Mundici

We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…

Logic · Mathematics 2018-02-12 Egor Ianovski , Keng Meng Ng , Russell Miller , Andre Nies

This paper first gives a necessary and sufficient condition that a lattice $L$ can be represented as the collection of all up-sets of a poset. Applying the condition, it obtains a necessary and sufficient condition that a lattice can be…

Representation Theory · Mathematics 2017-01-17 Peng He , Xue-ping Wang

An integral quadratic lattice is called indefinite $k$-universal if it represents all integral quadratic lattices of rank $k$ for a given positive integer $k$. For $k\geq 3$, we prove that the indefinite $k$-universal property satisfies the…

Number Theory · Mathematics 2023-06-06 Zilong He , Yong Hu , Fei Xu

General theory determines the notion of separable MV-algebra (equivalently, of separable unital lattice-ordered Abelian group). We establish the following structure theorem: An MV-algebra is separable if, and only if, it is a finite product…

Rings and Algebras · Mathematics 2023-07-28 Vincenzo Marra , Matías Menni

A simple but elegant result of Rival states that every sublattice $L$ of a finite distributive lattice $\mathcal{P}$ can be constructed from $\mathcal{P}$ by removing a particular family $\mathcal{I}_L$ of its irreducible intervals.…

Combinatorics · Mathematics 2016-04-19 Mark Siggers

We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined…

Logic in Computer Science · Computer Science 2011-01-25 Antonio Bucciarelli

As the second part of the treatise 'A General Theory of Concept Lattice', this paper speaks of the tractability of the general concept lattice for both its lattice structure and logic content. The general concept lattice permits a feasible…

Logic in Computer Science · Computer Science 2019-08-13 Tsong-Ming Liaw , Simon C. Lin

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

Lattice theoretical generalizations of some classical linear algebra results are formulated. A vector space is replaced by its subspace lattice and a linear map is replaced by the induced lattice map. This map is a complete join…

Rings and Algebras · Mathematics 2007-05-23 Jeno Szigeti

The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…

General Mathematics · Mathematics 2017-02-27 Danica Jakubíková-Studenovská , Reinhard Pöschel , Sándor Radeleczki

One fruitful motivating principle of much research on the family of integrable systems known as ``Toda lattices'' has been the heuristic assumption that the periodic Toda lattice in an affine Lie algebra is directly analogous to the…

solv-int · Physics 2008-02-03 M. Quinn , S. F. Singer

Logical relations built on top of an operational semantics are one of the most successful proof methods in programming language semantics. In recent years, more and more expressive notions of operationally-based logical relations have been…

Logic in Computer Science · Computer Science 2024-08-07 Francesco Dagnino , Francesco Gavazzo

The reticulation of an algebra $A$ is a bounded distributive lattice ${\cal L}(A)$ whose prime spectrum of filters or ideals is homeomorphic to the prime spectrum of congruences of $A$, endowed with the Stone topologies. We have obtained a…

Rings and Algebras · Mathematics 2017-06-15 George Georgescu , Claudia Mureşan

A survey is given of the work on strong regularity for uniform algebras over the last thirty years, and some new results are proved, including the following. Let A be a uniform algebra on a compact space X and let E be the set of all those…

Functional Analysis · Mathematics 2007-05-23 J. F. Feinstein , D. W. B. Somerset

For commutative rings, we introduce the notion of a {\em universal grading}, which can be viewed as the "largest possible grading". While not every commutative ring (or order) has a universal grading, we prove that every {\em reduced order}…

Commutative Algebra · Mathematics 2018-04-18 H. W. Lenstra, , A. Silverberg
‹ Prev 1 3 4 5 6 7 10 Next ›