Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
From MaRDI portal
Publication:1936277
DOI10.1007/s10469-012-9199-0zbMath1286.03127OpenAlexW2093848965MaRDI QIDQ1936277
R. R. Tukhbatullina, Nikolay Bazhenov
Publication date: 21 February 2013
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-012-9199-0
Structure theory of Boolean algebras (06E05) Computable structure theory, computable model theory (03C57)
Related Items (5)
Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ Categoricity spectra for polymodal algebras ⋮ 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms ⋮ Boolean Algebras with Distinguished Endomorphisms and Generating Trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computable shuffle sums of ordinals
- Computable structures and the hyperarithmetical hierarchy
- Effective categoricity of equivalence structures
- Limitwise monotonic sequences and degree spectra of structures
- Degrees coded in jumps of orderings
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- Limitwise monotonic functions, sets, and degrees on computable domains
- η-representation of sets and degrees
This page was built for publication: Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism