相关论文: Elementary Properties of Free Lattices

We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…

In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…

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…

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

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…

If $G$ is a semisimple Lie group of real rank at least 2 and $\Gamma$ is an irreducible lattice in $G$, then every homomorphism from $\Gamma$ to the outer automorphism group of a finitely generated free group has finite image.

A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…

If $\Gamma$ is an irreducible non-uniform higher-rank characteristic zero arithmetic lattice (for example, $SL_n(\mathbb{Z})$, $n \geq 3$) and $\Lambda$ is a finitely generated group that is elementarily equivalent to $\Gamma$, then…

In this article, we investigate the status of the homomorphism preservation property amongst restricted classes of finite relational structures and algebraic structures. We show that there are many homomorphism-closed classes of finite…

Using conjugation of Shimura varieties, we produce nonisomorphic, cocompact, torsion-free lattices in $\mathrm{PU}(n,1)$ with isomorphic profinite completions for all $n \ge 2$. This disproves a conjecture of D. Kazhdan and gives the first…

For finite dimensional hermitean inner product spaces $V$, over $*$-fields $F$, and in the presence of orthogonal bases providing form elements in the prime subfield of $F$, we show that quantifier free definable relations in the subspace…

We establish conditions under which lattices in certain simple Lie groups are profinitely solitary in the absolute sense, so that the commensurability class of the profinite completion determines the commensurability class of the group…

We investigate when fiber products of lattices are finitely generated and obtain a new characterization of bounded lattice homomorphisms onto lattices satisfying a property we call Dean's condition (D) which arises from Dean's solution to…

This article is part of my upcoming masters thesis which investigates the following open problem from the book, Free Lattices, by R.Freese, J.Jezek, and J.B. Nation published in 1995: "Which lattices (and in particular which countable…

We investigate the problem of elementary equivalence of the free group factors, that is, do all free group factors $L(\mathbb{F}_n)$ share a common first-order theory? We establish a trichotomy of possibilities for their common first-order…

In this paper we consider a general way of constructing profinite struc- tures based on a given framework - a countable family of objects and a countable family of recognisers (e.g. formulas). The main theorem states: A subset of a family…

Let $G$ be a real centre-free semisimple Lie group without compact factors. I prove that irreducible lattices in $G$ are rigid under two types of sublinear distortions. The first result is that the class of lattices in groups that do not…

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…

By a 1941 result of Ph. M. Whitman, the free lattice FL(3) on three generators includes a sublattice $S$ that is isomorphic to the lattice FL($\omega$)=FL($\aleph_0$) generated freely by denumerably many elements. The first author has…

Let n be finite >2. We show that any class between S\Nr_n\CA_{n+3} and RCA_n is not atom canonical, and any class containing the class of completely representable algebras and contained in S_c\Nr_n\CA_{n+3} is not elementary. We show that…