Decidability and ℵ₀-categoricity of theories of partially ordered sets

E-ISSN： 1943-5886|45|3|585-611

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.45, Iss.3, 1980-09, pp. : 585-611

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Decidability and finite axiomatizability of theories of ℵ₀-categorical partially ordered sets

The Journal of Symbolic Logic, Vol. 46, Iss. 1, 1981-03 ,pp. : 101-120

Cambridge University Press

Access to resources Recommend Favorite

Coinductive ℵ₀-categorical theories

The Journal of Symbolic Logic, Vol. 55, Iss. 3, 1990-09 ,pp. : 1130-1137

Cambridge University Press

Access to resources Recommend Favorite

Existentially closed models via constructible sets: There are 2^ℵ0 existentially closed pairwise non elementarily equivalent existentially closed ordered groups

The Journal of Symbolic Logic, Vol. 61, Iss. 1, 1996-03 ,pp. : 277-284

Cambridge University Press

Access to resources Recommend Favorite

Nonarithmetical ℵ₀-categorical theories with recursive models

The Journal of Symbolic Logic, Vol. 59, Iss. 1, 1994-03 ,pp. : 106-112

Cambridge University Press

Access to resources Recommend Favorite

Countable models of nonmultidimensional ℵ₀-stable theories

The Journal of Symbolic Logic, Vol. 48, Iss. 1, 1983-03 ,pp. : 197-205

Cambridge University Press

Access to resources Recommend Favorite