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
- Antichain polynomials of products of chains and minuscule posets
- Stability of quasi-stationary measures in high-dimensional products of mixing Markov chains
- From Common-Slot Chains to Heisenberg Central Products over Global Fields
- Bounded compositions and products of chains, or bi(s)nomials everywhere from de Moivre's formula to spin multiplicities and constant-sum codes
- Products in KK- and E-theory
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 -