Autostability and computable families of constructivizations
From MaRDI portal
Cites work
Cited in
(24)- Categoricity and complexity of relations over algebraic structures
- 2010 North American Annual Meeting of the Association for Symbolic Logic
- Degrees of categoricity on a cone via \(\eta\)-systems
- Categoricity for primitive recursive and polynomial Boolean algebras
- Categoricity spectra of computable structures
- Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
- Constructing decidable graphs from decidable structures
- Categoricity properties for computable algebraic fields
- Computable isomorphisms, degree spectra of relations, and Scott families
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- Feasibly categorical models
- Effective categoricity of computable linear orderings
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
- A computably stable structure with no Scott family of finitary formulas
- Uncountable degree spectra
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Complexity and categoricity
- Stability of recursive structures in arithmetical degrees
- Categoricity in hyperarithmetical degrees
- Stability among r.e. quotient algebras
- Effective categoricity of equivalence structures
- Strong \(\Delta ^ 0_ 2\) categoricity
- Recursive properties of isomorphism types
- Recursive categoricity and recursive stability
This page was built for publication: Autostability and computable families of constructivizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1247964)
