Pages that link to "Item:Q1916896"

The following pages link to Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree (Q1916896):

Displaying 12 items.

• Two embedding theorems for lower bounded lattices (Q1272234) (← links)
• A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (Q1295397) (← 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)
• A nonlow\(_2\) r. e. degree with the extension of embeddings properties of a low\(_2\) degree (Q2776819) (← links)
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES (Q3521597) (← links)
• Lattice embeddings into the recursively enumerable degrees (Q3770516) (← links)
• Maximal contiguous degrees (Q4532623) (← links)
• A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES (Q4637942) (← links)
• Lattice embeddings and array noncomputable degrees (Q4736749) (← links)
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element (Q5945396) (← links)