Countably categorical theories

DOI10.1007/S10469-012-9187-4zbMATH Open1272.03144OpenAlexW2052645577MaRDI QIDQ1928482FDOQ1928482

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Indiscernibles and decidable models
• Title not available (Why is that?)
• Computability of Fraïssé limits
• Title not available (Why is that?)

Cited In (12)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Strongly minimal countably categorical theories. II
• Strongly minimal countably categorical theories. III
• Theories categorical in power \(n+2\)
• On the ``heap problem
• STACS 2005
• Countable categoricity
• A decidable countably categorical model without nontrivial recursive automorphisms
• The index set of uncountably categorical theories
• 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)