Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3954890
- Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
- Lattice embeddings into the recursively enumerable degrees. II
- Lattice embeddings into the recursively enumerable degrees
- Embedding Lattices with Top Preserved Below Non‐GL2 Degrees
Cites work
- Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
- Every finite lattice can be embedded in a finite partition lattice
- Finitely Generated Codings and the Degrees R.E. in a Degree d
- scientific article; zbMATH DE number 3954890 (Why is no real title available?)
- Strong reducibilities
Cited in
(10)- Lattice representations for computability theory
- A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees
- Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table Degrees
- scientific article; zbMATH DE number 4170891 (Why is no real title available?)
- scientific article; zbMATH DE number 3954890 (Why is no real title available?)
- Lattice embeddings into the recursively enumerable degrees
- Lattice Embeddings into the R.E. Degrees Preserving 0 and 1
- Embedding lattices into the wtt-degrees below 0′
- Recursively Enumerable m - and tt -Degrees III: Realizing all Finite Distributive Lattices
- Lattice embeddings and array noncomputable degrees
This page was built for publication: Lattice Embeddings in the Recursively Enumerable Truth Table Degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030813)