Minimale schwache Wahrheitstabellengrade und berechenbar aufzählbare Turinggrade, Pa...
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees, Paperback by Downey, Rodney G.; Ng, Keng Meng; Solomon, Reed, ISBN 1470441624, ISBN-13 9781470441623, Like New Used, Free shipping in the US Considering how minimal weak truth table degrees interact with computably enumerable Turing degrees, Downey, Ng, and Solomon obtain three main results. First, there are sets with minimal weak truth table degree that bound noncomputable computably enumerable sets under Turing reducibility. Second, no set with computable enumerable Turing degree can have minimal weak truth table degree. And third, no ?02 set that Turing bounds a promptly simple set can have minimal weak truth table degree. Annotation ©2020 Ringgold, Inc., Portland, OR ()
Jetzt bei Ebay:
