Decidability and ℵ0-categoricity of theories of partially ordered sets
- 1 September 1980
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 45 (3) , 585-611
- https://doi.org/10.2307/2273425
Abstract
This paper is primarily concerned with ℵ0-categoricity of theories of partially ordered sets. It contains some general conjectures, a collection of known results and some new theorems on ℵ0-categoricity. Among the latter are the following.Corollary 3.3. For every countable ℵ0-categoricalthere is a linear order of A such that (, <) is ℵ0-categorical.Corollary 6.7. Every ℵ0-categorical theory of a partially ordered set of finite width has a decidable theory.Theorem 7.7. Every ℵ0-categorical theory of reticles has a decidable theory.There is a section dealing just with decidability of partially ordered sets, the main result of this section beingTheorem 8.2. If (P, <) is a finite partially ordered set and KP is the class of partially ordered sets which do not embed (P, <), then Th(KP) is decidable iff KP contains only reticles.Keywords
This publication has 12 references indexed in Scilit:
- No-categoricity in first-order predicate calculus1Theoria, 2008
- ℵ 0 -Categoricity of Partially Ordered Sets of Width 2Proceedings of the American Mathematical Society, 1977
- The decidability of some $ℵ_0$-categorical theoriesColloquium Mathematicum, 1976
- The strong amalgamation propertyColloquium Mathematicum, 1975
- Algebraic closure operators and strong amalgamation basesAlgebra universalis, 1974
- On complete theories with a finite number of denumerable modelsAlgebra and Logic, 1973
- Partial orders of dimension 2Networks, 1972
- $ℵ_0$-categoricity of linear orderingsFundamenta Mathematicae, 1969
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950
- Partially Ordered SetsAmerican Journal of Mathematics, 1941