An extension of the nondiamond theorem in classical and α-recursion theory

Journal of Symbolic Logic 49 (2):586-607 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274191

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,846

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The uniform regular set theorem in α-recursion theory.Wolfgang Maass - 1978 - Journal of Symbolic Logic 43 (2):270-279.
On the recursion theorem in iterative operative spaces.J. Zashev - 2001 - Journal of Symbolic Logic 66 (4):1727-1748.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
Power-like models of set theory.Ali Enayat - 2001 - Journal of Symbolic Logic 66 (4):1766-1782.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
Ramsey's theorem and recursion theory.Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (2):268-280.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.
Pseudoprojective strongly minimal sets are locally projective.Steven Buechler - 1991 - Journal of Symbolic Logic 56 (4):1184-1194.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.

Analytics

Added to PP
2009-01-28

Downloads
36 (#443,144)

6 months
11 (#237,138)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
On strongly jump traceable reals.Keng Meng Ng - 2008 - Annals of Pure and Applied Logic 154 (1):51-69.
Interpreting N in the computably enumerable weak truth table degrees.André Nies - 2001 - Annals of Pure and Applied Logic 107 (1-3):35-48.
On definable filters in computably enumerable degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.

Add more citations

References found in this work

Some minimal pairs of alpha-recursively enumerable degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):415.

Add more references