ℵ₀-categorical distributive lattices of finite breadth
- 1 April 1983
- journal article
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 87 (4) , 707-713
- https://doi.org/10.1090/s0002-9939-1983-0687647-2
Abstract
Every ℵ 0 {\aleph _0} -categorical distributive lattice of finite breadth has a finitely axiomatizable theory. This result extends the analogous result for partially ordered sets of finite width.Keywords
This publication has 10 references indexed in Scilit:
- Arborescent Structures. II: Interpretability in the Theory of TreesTransactions of the American Mathematical Society, 1981
- Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered setsThe Journal of Symbolic Logic, 1981
- Decidability and ℵ0-categoricity of theories of partially ordered setsThe Journal of Symbolic Logic, 1980
- Two-dimensional partial orderings: UndecidabilityThe Journal of Symbolic Logic, 1980
- Two-dimensional partial orderings: Recursive model theoryThe Journal of Symbolic Logic, 1980
- Aleph–zero categorical Stone algebrasJournal of the Australian Mathematical Society, 1978
- Lattice Theory: First Concepts and Distributive Lattices.The American Mathematical Monthly, 1973
- Some combinatorial problems on partially ordered setsProceedings of Symposia in Applied Mathematics, 1960
- Lattice Theory. By Garrett Birkhoff. 2nd edition. Pp. xiii, 283. $6. 1948. American Mathematical Society Colloquium Publications, 25. (American Mathematical Society, New York)The Mathematical Gazette, 1950
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950