Pages that link to "Item:Q1368585"

The following pages link to A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees (Q1368585):

Displaying 13 items.

• A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (Q1295397) (← links)
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees (Q1964021) (← links)
• 2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000 (Q2732529) (← 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)
• The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (Q4211072) (← links)
• 1998–1999 Winter Meeting of the Association for Symbolic Logic (Q4262607) (← links)
• Embedding finite lattices into the ideals of computably enumerable turing degrees (Q4328834) (← 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)
• Towards characterizing the \(> \omega^2\)-fickle recursively enumerable Turing degrees (Q6119790) (← links)