Embedding lattices into the wtt-degrees below 0′
From MaRDI portal
Publication:4323049
DOI10.2307/2275710zbMath0818.03021OpenAlexW2015048280MaRDI QIDQ4323049
Christine Ann Haught, Rodney G. Downey
Publication date: 10 August 1995
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275710
Representation theory of lattices (06B15) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)
Cites Work
- Unnamed Item
- Classification of degree classes associated with r.e. subspaces
- Every finite lattice can be embedded in a finite partition lattice
- The existence of recursively enumerable minimal truth-tabular degrees
- D.R.E. Degrees and the Nondiamond Theorem
- Strong reducibilities
- The weak truth table degrees of recursively enumerable sets
This page was built for publication: Embedding lattices into the wtt-degrees below 0′