Degrees of autostability relative to strong constructivizations
From MaRDI portal
Publication:2510761
DOI10.1134/S0081543811060071zbMath1294.03025OpenAlexW2076040483MaRDI QIDQ2510761
Publication date: 4 August 2014
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543811060071
Related Items (26)
On categoricity spectra for locally finite graphs ⋮ The index set of the groups autostable relative to strong constructivizations ⋮ Degrees of autostability relative to strong constructivizations of graphs ⋮ Degrees of autostability for prime Boolean algebras ⋮ Degrees of autostability relative to strong constructivizations for Boolean algebras ⋮ Degrees of autostability for linear orders and linearly ordered abelian groups ⋮ Every Δ20 degree is a strong degree of categoricity ⋮ Prime Model with No Degree of Autostability Relative to Strong Constructivizations ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations ⋮ A note on decidable categoricity and index sets ⋮ On decidable categoricity and almost prime models ⋮ Degrees of categoricity for superatomic Boolean algebras ⋮ Strong degrees of categoricity and weak density ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION ⋮ Categoricity spectra for polymodal algebras ⋮ 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms ⋮ Degrees of categoricity of rigid structures ⋮ Categoricity spectra of computable structures ⋮ The theory of projective planes is complete with respect to degree spectra and effective dimensions ⋮ Decompositions of decidable abelian groups ⋮ Turing degrees of complete formulas of almost prime models ⋮ The degree of decidable categoricity of a model with infinite solutions for complete formulas ⋮ Punctual categoricity spectra of computably categorical structures ⋮ Autostability spectra for Boolean algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Autostability of prime models under strong constructivizations
- Generic copies of countable structures
- Strong and weak constructivization and computable families
- Decidable models
- Computable structures and the hyperarithmetical hierarchy
- Categoricity in hyperarithmetical degrees
- Some aspects of generalized computability
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Enumerations in computable structure theory
- Degrees of categoricity of computable structures
- On autostability of almost prime models relative to strong constructivizations
- Effective procedures in field theory
- Intrinsic bounds on complexity and definability at limit levels
- Foundations of recursive model theory
- Oб алгебрах формул счётно категоричных теорий
- Recursively presentable prime models
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- Effective model theory vs. recursive model theory
- [Russian Text Ignored]
This page was built for publication: Degrees of autostability relative to strong constructivizations
