Initial segments of the degrees of size \(\aleph _ 1\)
From MaRDI portal
Publication:1820153
DOI10.1007/BF02772668zbMath0614.03040MaRDI QIDQ1820153
Publication date: 1986
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
forcingTuring degreesdegrees of unsolvabilitytruth-table degreesupper semi-latticecountable predecessor property
Related Items (11)
Lattices of c-degrees ⋮ Initial segments of the degrees of constructibility ⋮ Morasses, square and forcing axioms ⋮ Martin's axiom and embeddings of upper semi-lattices into the Turing degrees ⋮ Intervals of the Muchnik lattice ⋮ Cofinal maximal chains in the Turing degrees ⋮ The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory ⋮ Embedding jump upper semilattices into the Turing degrees ⋮ Lattice initial segments of the hyperdegrees ⋮ Maximal chains in the Turing degrees ⋮ Local Initial Segments of The Turing Degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Degrees of unsolvability: structure and theory
- On degrees of recursive unsolvability
- First-order theory of the degrees of recursive unsolvability
- Initial segments of the degrees of unsolvability
- The upper semi-lattice of degrees of recursive unsolvability
- Independence Results on the Global Structure of the Turing Degrees
- Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
- Reducibility orderings: Theories, definability and automorphisms
- Countable initial segments of the degrees of unsolvability
- The homogeneity conjecture
- Distributive Initial Segments of the Degrees of Unsolvability
- Initial Segments of Turing Degrees
- Sublattices and Initial Segments of the Degrees of Unsolvability
- The strong homogeneity conjecture
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: Initial segments of the degrees of size \(\aleph _ 1\)
