Autostability and computable families of constructivizations
From MaRDI portal
Publication:1247964
DOI10.1007/BF01668470zbMath0382.03033OpenAlexW1988958321MaRDI QIDQ1247964
Publication date: 1976
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01668470
Classification theory, stability, and related concepts in model theory (03C45) Theory of numerations, effectively presented structures (03D45)
Related Items (24)
Strong \(\Delta ^ 0_ 2\) categoricity ⋮ Recursive categoricity and recursive stability ⋮ Stability of recursive structures in arithmetical degrees ⋮ Complexity and categoricity ⋮ Feasibly categorical models ⋮ Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations ⋮ Categoricity for primitive recursive and polynomial Boolean algebras ⋮ Some effects of Ash-Nerode and other decidability conditions on degree spectra ⋮ Uncountable degree spectra ⋮ Recursive properties of isomorphism types ⋮ Stability among r.e. quotient algebras ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ Effective categoricity of equivalence structures ⋮ A computably stable structure with no Scott family of finitary formulas ⋮ Categoricity spectra of computable structures ⋮ Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension ⋮ Categoricity and complexity of relations over algebraic structures ⋮ Effective categoricity of computable linear orderings ⋮ Constructing decidable graphs from decidable structures ⋮ 2010 North American Annual Meeting of the Association for Symbolic Logic ⋮ Categoricity in hyperarithmetical degrees ⋮ Computable isomorphisms, degree spectra of relations, and Scott families ⋮ Categoricity properties for computable algebraic fields ⋮ \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
Cites Work
This page was built for publication: Autostability and computable families of constructivizations
