We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.LO

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Logic

Title: Elementary Properties of Free Lattices

Abstract: We start a systematic analysis of the first-order model theory of free lattices. 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-bounded 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 elementarily 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 $\mathrm{(W)}$ and which is generated by join prime elements, the three lattices $\mathbf K$, $\mathrm{DM}(\mathbf K)$, and $\mathrm{Id}(\mathbf K)$ all share the same positive universal first-order theory.
Comments: 13 pages
Subjects: Logic (math.LO)
MSC classes: 03C05, 03C64, 06B05
Cite as: arXiv:2310.03366 [math.LO]
  (or arXiv:2310.03366v3 [math.LO] for this version)

Submission history

From: Gianluca Paolini [view email]
[v1] Thu, 5 Oct 2023 07:51:38 GMT (21kb)
[v2] Mon, 4 Mar 2024 21:26:25 GMT (23kb)
[v3] Wed, 27 Mar 2024 17:22:10 GMT (24kb)

Link back to: arXiv, form interface, contact.