2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms

DOI10.1007/S10958-015-2629-5zbMATH Open1349.03042OpenAlexW2239271290MaRDI QIDQ5741344FDOQ5741344

Authors: Nikolay Bazhenov 

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

zbMATH Keywords

degree of categoricityBoolean algebra with distinguished automorphism

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Autostability of models
• Computable structures and the hyperarithmetical hierarchy
• Title not available (Why is that?)
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Degrees of categoricity and the hyperarithmetic hierarchy
• Degrees of categoricity of computable structures
• Effective procedures in field theory
• Enumerations in computable structure theory
• Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
• Autostability of the Boolean algebra \(B_\omega\), enriched with an automorphism
• Recursive isomorphism types of recursive Boolean algebras
• Intrinsic bounds on complexity and definability at limit levels
• Title not available (Why is that?)
• Title not available (Why is that?)
• Autostable I-Algebras
• Degrees of autostability relative to strong constructivizations
• Automorphisms of Boolean algebras definable by fixed elements
• Title not available (Why is that?)

Cited In (1)

• Categoricity spectra for polymodal 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)