Degrees of categoricity for superatomic Boolean algebras
From MaRDI portal
Publication:2434601
DOI10.1007/s10469-013-9233-xzbMath1315.03052OpenAlexW2069010287MaRDI QIDQ2434601
Publication date: 6 February 2014
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-013-9233-x
Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) Categoricity and completeness of theories (03C35)
Related Items
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, Prime Model with No Degree of Autostability Relative to Strong Constructivizations, Degrees of categoricity of trees and the isomorphism problem, Index sets of autostable relative to strong constructivizations constructive models for familiar classes, On decidable categoricity and almost prime models, DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION, Degrees of categoricity of rigid structures, Categoricity spectra of computable structures, Turing degrees of complete formulas of almost prime models, On bi-embeddable categoricity of algebraic structures, Autostability spectra for Boolean algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Autostability of models
- Computable structures and the hyperarithmetical hierarchy
- Categoricity in hyperarithmetical degrees
- Constructivizability of superatomic Boolean algebras
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of autostability relative to strong constructivizations
- Enumerations in computable structure theory
- Degrees of categoricity of computable structures
- Recursive isomorphism types of recursive Boolean algebras
- Intrinsic bounds on complexity and definability at limit levels
