Sets with no subsets of higher weak truth-table degree

Patrizio Cintioli

Abstrakt

We consider the weak truth-table reducibility < wtt and we prove the existence of wtt-introimmune sets in 02. This closes the gap on the existence of arithmetical r-introimmune sets for all the known reducibilities < r strictly contained in the Turing reducibility.

Słowa kluczowe: weak truth-table reducibility, introimmune sets.
References

K. Ambos-Spies, Problems which Cannot Be Reduced to Any Proper Subproblems, Proc. 28th International Symposium, MFCS 2003, Lectures Notes in Computer Science 2747, (B. Rovan and P. Vojtas, Eds.), (Springer, Berlin, 2003), 162-168.

K. Ambos-Spies. Private communication.

P. Cintioli, Sets without Subsets of Higher Many-One Degree, Notre Dame Journal of Formal Logic 46:2 (2005), 207-216.

P. Cintioli, Low sets without subsets of higher many-one degree, Mathematical Logic Quarterly 57:5 (2011), 517-523.

P. Cintioli and R. Silvestri, Polynomial Time Introreducibility, Theory of Computing Systems 36:1 (2003), 1-15.

R. G. Downey and D. R. Hirschfeldt, Algorithmic Randomness and Complexity, Springer-Verlag, 2010.

C. G. Jockusch Jr., Upward closure and cohesive degrees, Israel Journal of Mathematics 15:3 (1973), 332-335.

P. Odifreddi, Strong reducibilities, Bulletin of the American Mathematical Society 4:1 (1981), 37-86.

P. Odifreddi, Classical Recursion Theory, vol. 125 of Studies in Logic and the Foundations of Mathematics, North Holland Publishing Company, Amsterdam, 1989.

S. G. Simpson, Sets Which Do Not Have Subsets of Every Higher Degree, The Journal of Symbolic Logic 43:1 (1978), 135-138.

R. I. Soare, Sets with no Subset of Higher Degrees, The Journal of Symbolic Logic 34:1 (1969), 53-56.

R. I. Soare, Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin Heidelberg, 1987.

Czasopismo ukazuje się w sposób ciągły on-line.
Pierwotną formą czasopisma jest wersja elektroniczna.