The degrees of categorical theories with recursive models

DOI10.1090/S0002-9939-2013-11505-4zbMATH Open1323.03044MaRDI QIDQ2839320FDOQ2839320

Authors: Uri Andrews 

Publication date: 5 July 2013

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Recommendations

• Complexity of Categorical Theories with Computable Models
• scientific article; zbMATH DE number 1936725
• Complexity of categorical theories with computable models
• Nonarithmetical ℵ₀-categorical theories with recursive models
• Categoricity in hyperarithmetical degrees

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57)

Cites Work

• Title not available (Why is that?)
• Model Theory
• A new strongly minimal set
• Computable structures and the hyperarithmetical hierarchy
• Recursively presentable prime models
• Title not available (Why is that?)
• MM. Borel, Tits, Zil′ber et le Général Nonsense
• Nonarithmetical ℵ₀-categorical theories with recursive models
• Complexity of Categorical Theories with Computable Models
• A new spectrum of recursive models using an amalgamation construction
• Trivial, strongly minimal theories are model complete after naming constants
• Recursive spectra of strongly minimal theories satisfying the Zilber trichotomy
• A computable ℵ₀-categorical structure whose theory computes true arithmetic

Cited In (14)

• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• Computing and dominating the Ryll-Nardzewski function
• The complexity of countable categoricity in finite languages
• Categoricity and generalized model completeness
• Recursive categoricity and persistence
• Title not available (Why is that?)
• Model-theoretic properties of the \(n\)-c.e. degrees
• Building models of strongly minimal theories
• Recursive spectra of flat strongly minimal theories
• The degree of decidable categoricity of a model with infinite solutions for complete formulas
• Complexity of Categorical Theories with Computable Models
• Sufficiency conditions for theories with recursive models
• Categoricity in hyperarithmetical degrees
• Computably categorical structures and expansions by constants

This page was built for publication: The degrees of categorical theories with recursive models

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