EMBEDDING LATTICES INTO THE wtt-DEGREES BELOW 0' 1361 constructions concerned with -wtt (< 0') rather delicate and, in parti to rather preclude the use of ...
A reducibility ≤p is a procedure whereby a set A can be computed from a set B. The most general and most extensively studied reducibility is Turing ...
Dec 1, 1994 · Abstract. A residuated lattice is said to be integrally closed if it satisfies the quasiequations x y ≤ x ⇒ y ≤ e and y x ≤ x ⇒ y ≤ e ...
1360-1382. Embedding Lattices into the wtt-Degrees Below 0'. Downey, Rod ; Haught, Christine. J. Symbolic Logic, Tome 59 (1994) no. 1, p. 1360-1382 / Harvested ...
Embedding lattices into the wtt -degrees below 0′. Journal of Symbolic Logic (1994). Rod Downey and Christine Haught · Link · Article. Undecidability and ...
4. R. G. DOWNEY and C. HAUGHT, 'Embedding lattices into the wtt-degrees below 0" to appear. 5. R. EPSTEIN, R ...
It is shown that the four element Boolean algebra can be embedded in the recursively enumerable truth-table degrees with least and greatest elements preserved.
Oct 2, 2006 · In fact the embedding is in the wtt-degrees ≤wtt 0′. To see that this is true, we need only check that there is a recursive function b(x) such ...
The key for this decision procedure is a characterization of the finite lattices which can be embedded into the r. e. wtt-degrees by a map which preserves the ...
Apr 4, 2007 · There is a least Turing degree that we denote by 0. It is the degree whose members are the computable sets. Every degree has at most countably ...
Missing: wtt- | Show results with:wtt-