Boolean algebras with distinguished endomorphisms and generating trees
From MaRDI portal
Publication:5741387
Recommendations
- Computable numberings of the class of Boolean algebras with distinguished endomorphisms
- Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism
- The degree spectra of definable relations on Boolean algebras
- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
- Boolean algebras of elementary characteristic \((1, 0, 1)\) with computable set of atoms and computable ideal of atomic elements
Cites work
- scientific article; zbMATH DE number 1746562 (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?)
- Almost computably enumerable families of sets
- Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism
- Computable isomorphisms of Boolean algebras with operators
- Computable numberings of the class of Boolean algebras with distinguished endomorphisms
- Computable single-valued numerations
- Computable structures and the hyperarithmetical hierarchy
- Constructivizability of superatomic Boolean algebras
- Constructivizability of the Boolean algebra \( \mathfrak{B}( \omega ) \) with a distinguished automorphism
- Degrees coded in jumps of orderings
- Enumerations in computable structure theory
- Enumerations, countable structures and Turing degrees
- Problem of the number of non-self-equivalent constructivizations
- Relative to any nonrecursive set
- Spectra of degrees of some structures
- The degree spectra of definable relations on Boolean algebras
Cited in
(4)
This page was built for publication: Boolean algebras with distinguished endomorphisms and generating trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741387)
