Pages that link to "Item:Q1964021"

The following pages link to A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees (Q1964021):

Displaying 9 items.

• A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (Q1295397) (← links)
• Lattice representations for computability theory (Q1295402) (← links)
• A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees (Q1368585) (← links)
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
• Degree Structures: Local and Global Investigations (Q3412461) (← links)
• Embedding finite lattices into the ideals of computably enumerable turing degrees (Q4328834) (← links)
• The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796) (← links)
• On the existence of a strong minimal pair (Q5501923) (← links)
• A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element (Q5945396) (← links)