Degrees of unsolvability of constructible sets of integers

&
Journal of Symbolic Logic 33 (4):497-513 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1969

DOI

10.2307/2271357

Links

PhilArchive



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

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

Degrees of unsolvability: structure and theory.Richard L. Epstein - 1979 - New York: Springer Verlag.
Generalized cohesiveness.Tamara Hummel & Carl G. Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.
The number of certain integral polynomials and nonrecursive sets of integers, part.Harvey Friedman - manuscript
Index sets and degrees of unsolvability.Michael Stob - 1982 - Journal of Symbolic Logic 47 (2):241-248.
Busy Beaver sets and the degrees of unsolvability.Robert P. Daley - 1981 - Journal of Symbolic Logic 46 (3):460-474.
Degrees of unsolvability: local and global theory.Manuel Lerman - 1983 - New York: Springer Verlag.
Eventually infinite time Turing machine degrees: Infinite time decidable reals.P. D. Welch - 2000 - Journal of Symbolic Logic 65 (3):1193-1203.
On the notational independence of various hierarchies of degrees of unsolvability.Gustav Hensel & Hilary Putnam - 1965 - Journal of Symbolic Logic 30 (1):69-86.
On external Scott algebras in nonstandard models of peano arithmetic.Vladimir Kanovei - 1996 - Journal of Symbolic Logic 61 (2):586-607.
A note on constructible sets of integers.Hilary Putnam - 1963 - Notre Dame Journal of Formal Logic 4 (4):270-273.

Analytics

Added to PP
2009-01-28

Downloads
233 (#82,757)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Gaps in the contructable universe.W. Marek & M. Srebrny - 1974 - Annals of Mathematical Logic 6 (3-4):359-394.
An application of recursion theory to analysis.Liang Yu - 2020 - Bulletin of Symbolic Logic 26 (1):15-25.
The limits of E-recursive enumerability.Gerald E. Sacks - 1986 - Annals of Pure and Applied Logic 31:87-120.
Mathematical definability.Theodore A. Slaman - 1998 - In H. G. Dales & Gianluigi Oliveri (eds.), Truth in Mathematics. Oxford University Press, Usa. pp. 233.

View all 12 citations / Add more citations

References found in this work

Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.
Computability & Unsolvability.Clifford Spector - 1958 - Journal of Symbolic Logic 23 (4):432-433.
A survey of Mathematical logic.Steven Orey - 1963 - Journal of Symbolic Logic 28 (4):288-289.
A note on constructible sets of integers.Hilary Putnam - 1963 - Notre Dame Journal of Formal Logic 4 (4):270-273.

Add more references