2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
From MaRDI portal
(Redirected from Publication:5741344)
Cites work
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Automorphisms of Boolean algebras definable by fixed elements
- Autostability of models
- Autostability of the Boolean algebra B_, enriched with an automorphism
- Autostable I-Algebras
- Computable structures and the hyperarithmetical hierarchy
- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
- Degrees of autostability relative to strong constructivizations
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of categoricity of computable structures
- Effective procedures in field theory
- Enumerations in computable structure theory
- scientific article; zbMATH DE number 3792144 (Why is no real title available?)
- scientific article; zbMATH DE number 1873435 (Why is no real title available?)
- scientific article; zbMATH DE number 934728 (Why is no real title available?)
- scientific article; zbMATH DE number 1390542 (Why is no real title available?)
- Intrinsic bounds on complexity and definability at limit levels
- Recursive isomorphism types of recursive Boolean algebras
This page was built for publication: 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741344)
