Pages that link to "Item:Q4205431"

The following pages link to Lattice embeddings into the recursively enumerable degrees. II (Q4205431):

Displaying 18 items.

• Lattice nonembeddings and initial segments of the recursively enumerable degrees (Q757358) (← links)
• Structural theory of degrees of unsolvability: advances and open problems (Q904325) (← links)
• A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (Q1295397) (← links)
• Splitting theorems in recursion theory (Q1314544) (← links)
• A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees (Q1368585) (← links)
• Lattice nonembeddings and intervals of the recursively enumerable degrees (Q1802183) (← links)
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree (Q1916896) (← links)
• Turing computability: structural theory (Q2036465) (← links)
• Diamond embeddings into the enumeration degrees (Q3060191) (← links)
• Degree Structures: Local and Global Investigations (Q3412461) (← links)
• Lattice embeddings into the recursively enumerable degrees (Q3770516) (← links)
• Annual Meeting of the Association for Symbolic Logic, Pittsburgh, 1991 (Q4008762) (← links)
• The existential theory of the poset of R.E. degrees with a predicate for single jump reducibility (Q4032885) (← links)
• Initial segments of the lattice of ideals of r.e. degrees (Q4323047) (← links)
• Generalized nonsplitting in the recursively enumerable degrees (Q4358047) (← links)
• Lattice embeddings and array noncomputable degrees (Q4736749) (← links)
• (Q4764099) (← links)
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element (Q5945396) (← links)