Autostability and computable families of constructivizations

DOI10.1007/BF01668470zbMath0382.03033MaRDI QIDQ1247964

Sergei S. Goncharov

Publication date: 1976

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

Mathematics Subject Classification ID

03C45: Classification theory, stability, and related concepts in model theory

03D45: Theory of numerations, effectively presented structures

Related Items

Categoricity properties for computable algebraic fields, 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, Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations, Strong \(\Delta ^ 0_ 2\) categoricity, Recursive categoricity and recursive stability, Stability of recursive structures in arithmetical degrees, Some effects of Ash-Nerode and other decidability conditions on degree spectra, Uncountable degree spectra, Stability among r.e. quotient algebras, Computable isomorphisms, degree spectra of relations, and Scott families, Complexity and categoricity, Categoricity in hyperarithmetical degrees, \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings, Effective categoricity of equivalence structures, A computably stable structure with no Scott family of finitary formulas, 2010 North American Annual Meeting of the Association for Symbolic Logic, Recursive properties of isomorphism types

Cites Work

• The number of countable generic models for finite forcing
• Unnamed Item