Lattice embeddings below a nonlow_ 2 recursively enumerable degree

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
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
Lower Bounds for Pairs of Recursively Enumerable Degrees
Lattice nonembeddings and intervals of the recursively enumerable degrees
The weak truth table degrees of recursively enumerable sets
Working below a \(low_ 2\) recursively enumerable degree
A minimal pair of recursively enumerable degrees
Completely mitotic r. e. degrees
Not every finite lattice is embeddable in the recursively enumerable degrees
Splitting theorems in recursion theory
Lattice embeddings into the recursively enumerable degrees
Degree theoretical splitting properties of recursively enumerable sets
A Completely Mitotic Nonrecursive R.E. Degree
Mitotic recursively enumerable sets
The density of infima in the recursively enumerable degrees
Bounding minimal pairs
Lattice embeddings into the recursively enumerable degrees. II
Lattice nonembeddings and initial segments of the recursively enumerable degrees
Minimal pairs and high recursively enumerable degrees
Highness and bounding minimal pairs
Sublattices of the Recursively Enumerable Degrees
Working below a high recursively enumerable degree
Axiomatizable theories with few axiomatizable extensions
Structural interactions of the recursively enumerable T- and W-degrees
Array nonrecursive degrees and lattice embeddings of the diamond
Embedding Lattices with Top Preserved Below Non‐GL₂ Degrees
Degree theoretic definitions of the low₂ recursively enumerable sets

Cited In (12)

Two embedding theorems for lower bounded lattices
Lattice embeddings and array noncomputable degrees
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
A nonlow\(_2\) r. e. degree with the extension of embeddings properties of a low\(_2\) degree
TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
Lattice embeddings into the recursively enumerable degrees
Lattice nonembeddings and intervals of the recursively enumerable degrees
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
Maximal contiguous degrees
A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1916896)