Pages that link to "Item:Q1295397"
From MaRDI portal
The following pages link to A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees (Q1295397):
Displaying 5 items.
- 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)
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
- Embedding finite lattices into the ideals of computably enumerable turing degrees (Q4328834) (← links)
- A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element (Q5945396) (← links)
