Elementary Properties of Free Lattices
Preprint
Abstract
We start a systematic analysis of the first-order model theory of free lattices. We prove several results. Firstly, we prove that the free lattices of finite rank are not positively indistinguishable, as there is a positive $\exists \forall$-sentence true in $\mathbf F_3$ and false in $\mathbf F_4$. Secondly, we show that every model of $\mathrm{Th}(\mathbf F_n)$ admits a canonical homomorphism into the profinite completion $\mathbf H_n$ of $\mathbf F_n$. Thirdly, we show that $\mathbf H_n$ is isomorphic to the Dedekind-MacNeille completion of $\mathbf F_n$, and that $\mathbf H_n$ is not positively elementary equivalent to $\mathbf F_n$, as there is a positive $\forall\exists$-sentence true in $\mathbf H_n$ and false in $\mathbf F_n$. Finally, we show that $\mathrm{DM}(\mathbf F_n)$ is a retract of $\mathrm{Id}(\mathbf F_n)$, and that for any lattice $\mathbf K$ which satisfies Whitman's condition $(W)$ and which is generated by join prime elements the lattices $\mathbf K$, $\mathrm{DM}(\mathbf K)$ and $\mathrm{Id}(\mathbf K)$ all share the same positive universal theory.
Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- First order rigidity of non-uniform higher rank arithmetic groupsInventiones Mathematicae, 2019
- Elementary theory of free non-abelian groupsJournal of Algebra, 2006
- DIOPHANTINE GEOMETRY OVER GROUPS VI: THE ELEMENTARY THEORY OF A FREE GROUPGeometric and Functional Analysis, 2006
- Positive theories of free monoidsAlgebra and Logic, 1993
- On the completion by cuts of distributive latticesProceedings of the Japan Academy, Series A, Mathematical Sciences, 1944