Related papers: Infinite Atomized Semilattices
We study the finite basis problem for $4$-element additively idempotent semirings whose additive reducts are quasi-antichains. Up to isomorphism, there are $93$ such algebras. We show that with the exception of the semiring $S_{(4, 435)}$,…
We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part.…
We give examples of atomic integral domains satisfying each of the eight logically possible combinations of existence or non-existence of the following kinds of elements: 1) primes, 2) absolutely irreducible elements that are not prime, and…
We completely determine all commutative semigroup varieties that are cancellable elements of the lattice SEM of all semigroup varieties. In particular, we prove that, for commutative varieties, the properties of being cancellable and…
The hypothesis that matter is made of some ultimate and indivisible objects, together the restricted relativity principle, establishes a constraint on the kind of variables we are allowed to use for the variational description of elementary…
It is known from Grzegorczyk's paper \cite{grze-1951} that the lattice of real semi-algebraic closed subsets of ${\mathbb R}^n$ is undecidable for every integer $n\geq 2$. More generally, if $X$ is any definable set over a real or…
A new model, in terms of finite bipartite graphs, of the free pseudosemilattice is presented. This will then be used to obtain several results about the variety SPS of all strict pseudosemilattices: (i) an identity basis for SPS is found,…
If ${\cal D}$ is a definable category then it may contain no nonzero finitely presented modules but, by a result of Makkai, there is a $\varinjlim$-generating set of strictly ${\cal D}$-atomic modules. These modules share some key…
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
We describe a quasiperiodic optical lattice, created by a physical realization of the abstract cut-and-project construction underlying all quasicrystals. The resulting potential is a generalization of the Fibonacci tiling. Calculation of…
The topological classification of all known non-magnetic crystalline compounds is now complete, revealing thousands of new candidate topological materials waiting to be explored in the lab.
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
Motivated by Gentzen disjunction elimination rule in his Natural Deduction calculus and reading inequalities with meet in a natural way, we conceive a notion of distributivity for join-semilattices. We prove that it is equivalent to a…
We study Archimedean atomic lattice effect algebras whose set of sharp elements is a complete lattice. We show properties of centers, compatibility centers and central atoms of such lattice effect algebras. Moreover, we prove that if such…
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…
We prove that persistently finite algebras are not created by completions of algebras, in any ordered discriminator variety. A persistently finite algebra is one without infinite simple extensions. We prove that finite measurable relation…
We introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…
We establish several independent results concerning extremal, left modular, congruence uniform, and semidistributive lattices. An equivalent characterization of left modular lattices is obtained in terms of edge-labellings, together with…
We introduce a lattice structure as a generalization of meet-continuous lattices and quantales. We develop a point-free approach to these new lattices and apply these results to $R$-modules. In particular, we give the module counterpart of…
We introduce the notion of pseudo-algebraicity to study atomic models of first order theories (equivalently models of a complete sentence of $L_{\omega_1,\omega}$. Theorem: Let $T$ be any complete first-order theory in a countable language…