Related papers: Von Neumann coordinatization is not first-order
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsible pushdown graphs. Our main results are the following.…
Let $L$ be a finite lattice and let $I$ be an ideal of $L$. Then the restriction map is a bounded lattice homomorphism of the congruence lattice of~$L$ into the congruence lattice of $I$. In a 2009 paper, the authors proved the converse. In…
Let $O$ be an order in a quadratic number field $K$ with ring of integers $D$, such that the conductor $\mathfrak F = f D$ is a prime ideal of $O$, where $f\in\mathbb Z$ is a prime. We give a complete description of the $\mathfrak…
We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…
In 1950, B.A. Trakhtenbrot showed that the set of first-order tautologies associated to finite models is not recursively enumerable. In 1999, P. H\'ajek generalized this result to the first-order versions of \L ukasiewicz, G\"odel and…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
It is proven that every geometric lattice of finite rank greater than 1 has a matching between the points and hyperplanes. This answers a question of P\'olya Prize-winner Anders Bj\"orner from the 1981 Banff Conference on Ordered Sets,…
We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…
A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…
We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…
Various authors have investigated properties of the star order (introduced by M.P. Drazin in 1978) on algebras of matrices and of bounded linear operators on a Hilbert space. Rickart involution rings (*-rings) are a certain algebraic…
Anti-elementarity is a strong way of ensuring that a class of structures , in a given first-order language, is not closed under elementary equivalence with respect to any infinitary language of the form L $\infty$$\lambda$. We prove that…
We consider majorization problems in the non-commutative setting. More specifically, suppose $E$ and $F$ are ordered normed spaces (not necessarily lattices), and $0 \leq T \leq S :E \to F$. If $S$ belongs to a certain ideal (for instance,…
Let R be a von Neumann algebra acting on a Hilbert space H and let R_sa be the set of selfadjoint elements of R. It is well known that R_sa is a lattice with respect to the usual partial order ≤ if and only if R is abelian. We define…
For a modular lattice $L$ of finite length, we prove that the distributivity of $L$ is a sufficient condition while its 2-distributivity is a necessary condition that those sublattices of $L$ that are closed under taking relative…
Let $R$ be a lattice ordered ring along with a truncation in the sense of Ball. We give a necessary and sufficient condition on $R$ for its unitization $R\oplus\mathbb{Q}$ to be again a lattice ordered ring. Also, we shall see that…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
We study effectively inseparable (e.i.) pre-lattices (i.e. structures of the form $L=\langle \omega, \wedge, \lor, 0, 1, \leq_L\rangle$ where $\omega$ denotes the set of natural numbers and the following hold: $\wedge, \lor$ are binary…