Countably categorical theories

DOI10.1007/s10469-012-9187-4zbMath1272.03144OpenAlexW2052645577MaRDI QIDQ1928482

V. G. Puzarenko

Publication date: 3 January 2013

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-012-9187-4

zbMATH Keywords

decidable theoryindiscerniblescountably categorical theoryFraïssé limitdecidable modelErshov conjecture about representability via linear orders

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Model theory of ordered structures; o-minimality (03C64) Categoricity and completeness of theories (03C35) Other model constructions (03C30)

Related Items (1)

On the ``heap problem

Cites Work

• Computability of Fraïssé limits
• Indiscernibles and decidable models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Countably categorical theories