Related papers: Model-completion of scaled lattices

We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…

Let $\Gamma$ be a discrete subgroup of a simply connected, solvable Lie group~$G$, such that $\Ad_G\Gamma$ has the same Zariski closure as $\Ad G$. If $\alpha \colon \Gamma \to \GL_n(\real)$ is any finite-dimensional representation…

The celebrated Smith-Minkowski-Siegel mass formula expresses the mass of a quadratic lattice (L, Q) as a product of local factors, called the local densities of (L,Q). This mass formula is an essential tool for the classification of…

Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite…

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.…

Slim semimodular lattices (for short, SPS lattices) and slim rectangular lattices (for short, SR lattices) were introduced by G. Gr\"atzer and E. Knapp in 2007 and 2009. These lattices are necessarily finite and planar, and they have been…

Motivated by the theory of locally definable groups, we study the theory of $K$-vector spaces with a predicate for the union $X$ of an infinite family of independent subspaces. We show that if $K$ is infinite then the theory is complete and…

We prove that up to scaling there are only finitely many integral lattices L of signature (2,n) with n>20 or n=17 such that the modular variety defined by the orthogonal group of L is not of general type. In particular, when n>107, every…

We construct Zariski-dense surface subgroups in infinitely many commensurability classes of uniform lattices of the split real Lie groups $\operatorname{SL}(n,\mathbb{R})$, $\operatorname{Sp}(2n,\mathbb{R})$, $\operatorname{SO}(k+1,k)$, and…

Finite rank median spaces are a simultaneous generalisation of finite dimensional ${\rm CAT}(0)$ cube complexes and real trees. If $\Gamma$ is an irreducible lattice in a product of rank one simple Lie groups, we show that every action of…

We prove the following theorem: let $\widetilde{\mathcal R}$ be an expansion of the real field $\overline{\mathbb R}$, such that every definable set (I) is a uniform countable union of semialgebraic sets, and (II) contains a "semialgebraic…

We show how to construct lattice sigma models in one, two and four dimensions which exhibit an exact fermionic symmetry. These models are discretized and {\it twisted} versions of conventional supersymmetric sigma models with N=2…

This article explores the model-dependent nature of set cardinality, emphasizing that cardinality is not absolute but varies across different axiomatic frameworks. Although Cantor's diagonal argument shows the real numbers are…

The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…

We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…

We show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thus improving the existing Cayley/Holland-style embedding theorem. We use this to show that the variety of all…

We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…