English

Elementary Properties of Free Lattices

Logic 2024-03-28 v3

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 F3\mathbf F_3 and false in F4\mathbf F_4. Secondly, we show that every model of Th(Fn)\mathrm{Th}(\mathbf F_n) admits a canonical homomorphism into the profinite-bounded completion Hn\mathbf H_n of Fn\mathbf F_n. Thirdly, we show that Hn\mathbf H_n is isomorphic to the Dedekind-MacNeille completion of Fn\mathbf F_n, and that Hn\mathbf H_n is not positively elementarily equivalent to Fn\mathbf F_n, as there is a positive \forall\exists-sentence true in Hn\mathbf H_n and false in Fn\mathbf F_n. Finally, we show that DM(Fn)\mathrm{DM}(\mathbf F_n) is a retract of Id(Fn)\mathrm{Id}(\mathbf F_n) and that for any lattice K\mathbf K which satisfies Whitman's condition (W)\mathrm{(W)} and which is generated by join prime elements, the three lattices K\mathbf K, DM(K)\mathrm{DM}(\mathbf K), and Id(K)\mathrm{Id}(\mathbf K) all share the same positive universal first-order theory.

Keywords

Cite

@article{arxiv.2310.03366,
  title  = {Elementary Properties of Free Lattices},
  author = {J. B. Nation and Gianluca Paolini},
  journal= {arXiv preprint arXiv:2310.03366},
  year   = {2024}
}

Comments

13 pages