Pages that link to "Item:Q1142206"

The following pages link to Not every finite lattice is embeddable in the recursively enumerable degrees (Q1142206):

Displaying 21 items.

• Infima in the d.r.e. degrees (Q685080) (← links)
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical (Q802550) (← links)
• The density of the nonbranching degrees (Q1055403) (← links)
• Branching in the enumeration degrees of the \(\Sigma_2^0\) sets (Q1293973) (← 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)
• Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree (Q1916896) (← links)
• Definability in the Recursively Enumerable Degrees (Q3128481) (← links)
• Hierarchy of Computably Enumerable Degrees II (Q3380356) (← links)
• Degree Structures: Local and Global Investigations (Q3412461) (← links)
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES (Q3521597) (← links)
• Lattice embeddings into the recursively enumerable degrees. II (Q4205431) (← links)
• Initial segments of the lattice of ideals of r.e. degrees (Q4323047) (← links)
• Embedding finite lattices into the ideals of computably enumerable turing degrees (Q4328834) (← links)
• Generalized nonsplitting in the recursively enumerable degrees (Q4358047) (← links)
• Embedding finite lattices into the Σ₂⁰ enumeration degrees (Q4532601) (← links)
• A HIERARCHY OF COMPUTABLY ENUMERABLE DEGREES (Q4637942) (← links)
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element (Q5945396) (← links)
• Embeddings of \(N_5\) and the contiguous degrees (Q5956887) (← links)
• Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees (Q6119790) (← links)