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

DOI10.2307/2273425zbMath0441.03007OpenAlexW2122148861MaRDI QIDQ3882438

James H. Schmerl

Publication date: 1980

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

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

zbMATH Keywords

partially ordered setcategoricityfinite widthreticle

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Ordered sets (06A99) Models of other mathematical theories (03C65) Model theory of denumerable and separable structures (03C15) Categoricity and completeness of theories (03C35)

Related Items (7)

QE commutative nilrings ⋮ Partially ordered sets and the independence property ⋮ The structure of random automorphisms of countable structures ⋮ Amalgamations preserving ℵ₁-categoricity ⋮ QE nil-2 groups of exponent 4 ⋮ Decidability and finite axiomatizability of theories of ℵ₀-categorical partially ordered sets ⋮ The structure of the models of decidable monadic theories of graphs

Cites Work

• Unnamed Item
• Algebraic closure operators and strong amalgamation bases
• A decomposition theorem for partially ordered sets
• Partially Ordered Sets

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