Decidability and Finite Axiomatizability of Theories of $\aleph_0$-Categorical Partially Ordered Sets
Schmerl, James H.
J. Symbolic Logic, Tome 46 (1981) no. 1, p. 101-120 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Every $\aleph_0$-categorical partially ordered set of finite width has a finitely axiomatizable theory. Every $\aleph_0$-categorical partially ordered set of finite weak width has a decidable theory. This last statement constitutes a major portion of the complete (with three exceptions) characterization of those finite partially ordered sets for which any $\aleph_0$-categorical partially ordered set not embedding one of them has a decidable theory.
Publié le : 1981-03-14
Classification:  
@article{1183740725,
     author = {Schmerl, James H.},
     title = {Decidability and Finite Axiomatizability of Theories of $\aleph\_0$-Categorical Partially Ordered Sets},
     journal = {J. Symbolic Logic},
     volume = {46},
     number = {1},
     year = {1981},
     pages = { 101-120},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183740725}
}

Schmerl, James H. Decidability and Finite Axiomatizability of Theories of $\aleph_0$-Categorical Partially Ordered Sets. J. Symbolic Logic, Tome 46 (1981) no. 1, pp.  101-120. http://gdmltest.u-ga.fr/item/1183740725/