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

DOI10.2307/2273263zbMATH Open0475.03010OpenAlexW2032248274MaRDI QIDQ3931366FDOQ3931366

Authors: James H. Schmerl 

Publication date: 1981

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273263

zbMATH Keywords

aleph-zero-categoricity

Mathematics Subject Classification ID

Partial orders, general (06A06) Decidability of theories and sets of sentences (03B25) Categoricity and completeness of theories (03C35) Model theory of denumerable and separable structures (03C15) Models of other mathematical theories (03C65)

Cites Work

• Theories of linear order
• Decidability and ℵ₀-categoricity of theories of partially ordered sets

Cited In (1)

• The structure of the models of decidable monadic theories of graphs

This page was built for publication: Decidability and finite axiomatizability of theories of ℵ₀-categorical partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3931366)