Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree

DOI10.1007/BF02762706zbMath0849.03030MaRDI QIDQ1916896

Richard A. Shore, Rodney G. Downey

Publication date: 28 October 1996

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

recursively enumerable degreelattice embedding\(\text{nonlow}_ 2\) degree

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (6)

Maximal contiguous degrees ⋮ TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES ⋮ A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES ⋮ A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element ⋮ The Role of True Finiteness in the Admissible Recursively Enumerable Degrees ⋮ A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Working below a \(low_ 2\) recursively enumerable degree
• Lattice nonembeddings and initial segments of the recursively enumerable degrees
• The density of infima in the recursively enumerable degrees
• Structural interactions of the recursively enumerable T- and W-degrees
• Completely mitotic r. e. degrees
• Not every finite lattice is embeddable in the recursively enumerable degrees
• Splitting theorems in recursion theory
• Array nonrecursive degrees and lattice embeddings of the diamond
• Lattice nonembeddings and intervals of the recursively enumerable degrees
• Degrees of members of \(\Pi_ 1^ 0\) classes
• On the degrees less than 0'
• An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
• Lattice embeddings into the recursively enumerable degrees
• Degree theoretical splitting properties of recursively enumerable sets
• Bounding minimal pairs
• A Completely Mitotic Nonrecursive R.E. Degree
• Minimal pairs and high recursively enumerable degrees
• The weak truth table degrees of recursively enumerable sets
• Lattice embeddings into the recursively enumerable degrees. II
• Working below a high recursively enumerable degree
• Highness and bounding minimal pairs
• Mitotic recursively enumerable sets
• Degree theoretic definitions of the low₂ recursively enumerable sets
• Embedding Lattices with Top Preserved Below Non‐GL₂ Degrees
• A minimal pair of recursively enumerable degrees
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Sublattices of the Recursively Enumerable Degrees
• Axiomatizable theories with few axiomatizable extensions

This page was built for publication: Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree