Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 2 min ago
PreprintarXiv licencearXiv

Model Theory of Products of Chains

Abstract

We show that regarding the model-theoretic properties of distributive lattices isomorphic to finite products of linear orders there is a significant symmetry: if 𝕏i, i<n are linear orders of size >1, 𝒯:=mathopTh (∏ i<n𝕏 i) and 𝒯i:=mathopTh (𝕏i), for i<n, then 𝒯 is finitely axiomatizable (resp. atomic, small) iff 𝒯i, i<n, are finitely axiomatizable (resp. atomic, small); the countable atomic (resp. countably saturated) model of 𝒯, if it exists, is the product of countable atomic (resp. countably saturated) models of 𝒯i; further, we describe all models of 𝒯: 𝕐 ⊨ 𝒯 iff 𝕐≅ ∏ i<n𝕐i, where 𝕐 i ⊨ 𝒯i, for i<n, and show that 𝔼 preccurlyeq ∏ i<n𝕏i iff 𝔼 = ∏ i<n𝔼i, where 𝔼i preccurlyeq 𝕏i, for i<n. (I(𝒯,Ο‰)∈ { 1,c} was proved in a previous paper.) In addition, for each n∈ β„• the class π’žn of distributive lattices isomorphic to a direct product of n linear orders of size >1 is first order definable.

Related

  1. Antichain polynomials of products of chains and minuscule posets
    Xi Chen, Yuxian Dong, Sihao Tang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. Stability of quasi-stationary measures in high-dimensional products of mixing Markov chains
    Matteo Tanzi, Giuseppe Tenaglia
    arXivPreprintCC0Full textDynamical systemsProbabilityarXiv
  3. From Common-Slot Chains to Heisenberg Central Products over Global Fields
    Marina Palaisti
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. Bounded compositions and products of chains, or bi(s)nomials everywhere from de Moivre's formula to spin multiplicities and constant-sum codes
    Hacène Belbachir, José Ricardo G. Mendonça
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsMathematical physicsarXiv
  5. Products in KK- and E-theory
    Ulrich Bunke, Benjamin Duenzinger
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryAnalysis & PDEsarXiv
BibTeX
@misc{kurilic2026model,
  title = {{Model Theory of Products of Chains}},
  author = {Miloő S. Kurilić},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.24683},
  eprint = {2610.24683},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.24683},
}
RIS
TY  - UNPB
TI  - Model Theory of Products of Chains
AU  - Miloő S. Kurilić
PY  - 2026
DA  - 2026/10/17
PB  - arXiv
DO  - 10.48550/arxiv.2610.24683
UR  - https://arxiv.org/abs/2610.24683
AB  - We show that regarding the model-theoretic properties of distributive lattices isomorphic to finite products of linear orders there is a significant symmetry: if 𝕏_i, i<n are linear orders of size >1, 𝒯:=mathopTh (∏ _i<n𝕏 _i) and 𝒯_i:=mathopTh (𝕏_i), for i<n, then 𝒯 is finitely axiomatizable (resp. atomic, small) iff 𝒯_i, i<n, are finitely axiomatizable (resp. atomic, small); the countable atomic (resp. countably saturated) model of 𝒯, if it exists, is the product of countable atomic (resp. countably saturated) models of 𝒯_i; further, we describe all models of 𝒯: 𝕐 ⊨ 𝒯 iff 𝕐≅ ∏ _i<n𝕐_i, where 𝕐 _i ⊨ 𝒯_i, for i<n, and show that 𝔼 preccurlyeq ∏ _i<n𝕏_i iff 𝔼 = ∏ _i<n𝔼_i, where 𝔼_i preccurlyeq 𝕏_i, for i<n. (I(𝒯,Ο‰)∈ { 1,c} was proved in a previous paper.) In addition, for each n∈ β„• the class π’ž_n of distributive lattices isomorphic to a direct product of n linear orders of size >1 is first order definable.
ER  -