2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
From MaRDI portal
Publication:5741344
DOI10.1007/s10958-015-2629-5zbMath1349.03042OpenAlexW2239271290MaRDI QIDQ5741344
Publication date: 22 July 2016
Published in: Journal of Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-015-2629-5
Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Autostability of models
- Computable structures and the hyperarithmetical hierarchy
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Automorphisms of Boolean algebras definable by fixed elements
- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
- 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
- Effective procedures in field theory
- Recursive isomorphism types of recursive Boolean algebras
- Intrinsic bounds on complexity and definability at limit levels
- Autostable I-Algebras
This page was built for publication: 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms