Boolean algebras, Stone spaces, and the iterated Turing jump

DOI10.2307/2275695zbMath0819.03034OpenAlexW2044599148MaRDI QIDQ4323032

Carl G. jun. Jockusch, Robert I. Soare

Publication date: 27 August 1995

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275695

zbMATH Keywords

jump degreerecursively enumerable degreescountable Boolean algebrasdegree of a model

Mathematics Subject Classification ID

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

Related Items (10)

New degree spectra of Polish spaces ⋮ Effective presentability of Boolean algebras of Cantor-Bendixson rank 1 ⋮ On the effective universality of mereological theories ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Jump degrees of torsion-free abelian groups ⋮ Measuring complexities of classes of structures ⋮ Every recursive Boolean algebra is isomorphic to one with incomplete atoms ⋮ Coding and definability in computable structures ⋮ Every Low Boolean Algebra is Isomorphic to a Recursive One ⋮ On the $n$-back-and-forth types of Boolean algebras

Cites Work

• Degrees of orderings not isomorphic to recursive linear orderings
• Degrees coded in jumps of orderings
• Transfinite extensions of Friedberg's completeness criterion
• Unnamed Item
• Unnamed Item

This page was built for publication: Boolean algebras, Stone spaces, and the iterated Turing jump