Countably categorical theories

DOI10.1007/S10469-012-9187-4MaRDI QIDQ1928482zbMATH OpenOpenAlexFDO

Authors Vadim 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

countably categorical theory[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Fra%EF%BF%BD%EF%BF%BDss%EF%BF%BD%EF%BF%BD+limit&go=Go Fra��ss�� limit]decidable modeldecidable theoryindiscerniblesErshov conjecture about representability via linear orders

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2154089
• The complexity of isomorphism for complete theories of linear orders with unary predicates
• Computability and uncountable linear orders. I: Computable categoricity.
• \(\Sigma \)-definability of uncountable models of \(c\)-simple theories
• On quantifier-rank equivalence between linear orders
• A five element basis for the uncountable linear orders
• scientific article; zbMATH DE number 2167511
• scientific article; zbMATH DE number 3884139
• On interpretability of almost linear orderings
• The metamathematics of scattered linear orderings

Cites work

• scientific article; zbMATH DE number 53151 (Why is no real title available?)
• scientific article; zbMATH DE number 1302874 (Why is no real title available?)
• scientific article; zbMATH DE number 2047495 (Why is no real title available?)
• scientific article; zbMATH DE number 2154089 (Why is no real title available?)
• scientific article; zbMATH DE number 1873434 (Why is no real title available?)
• scientific article; zbMATH DE number 1390542 (Why is no real title available?)
• Computability of Fraïssé limits
• Indiscernibles and decidable models

Cited in

(12)

• Theories categorical in power \(n+2\)
• On the ``heap problem
• scientific article; zbMATH DE number 175638 (Why is no real title available?)
• Countable categoricity
• scientific article; zbMATH DE number 4121975 (Why is no real title available?)
• STACS 2005
• The index set of uncountably categorical theories
• Strongly minimal countably categorical theories. II
• Strongly minimal countably categorical theories. III
• A decidable countably categorical model without nontrivial recursive automorphisms
• scientific article; zbMATH DE number 4004164 (Why is no real title available?)
• Combinations related to classes of finite and countably categorical structures and their theories

This page was built for publication: Countably categorical theories

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