- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Degrees of unsolvability of constructible sets of integers
Journal of Symbolic Logic 33 (4):497-513 (1968)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
George Boolos and Hilary Putnam. Degrees of unsolvability of constructible sets of integers. The journal of symbolic logic, vol. 33 no. 4 , pp. 497–513.A. S. Kechris - 1973 - Journal of Symbolic Logic 38 (3):527-528.
Review: Hilary Putnam, A Note on Constructible Sets of Integers. [REVIEW]Richard Mansfield - 1971 - Journal of Symbolic Logic 36 (2):339-340.
Hilary Putnam. A note on constructible sets of integers. Notre Dame journal of formal logic, vol. 4 no. 4 , pp. 270–273. [REVIEW]Richard Mansfield - 1971 - Journal of Symbolic Logic 36 (2):339-340.
Review: Gustav Hensel, Hilary Putnam, On the Notational Independence of Various Hierarchies of Degrees of Unsolvability. [REVIEW]Yiannis N. Moschovakis - 1967 - Journal of Symbolic Logic 32 (1):124-125.
Gustav Hensel and Hilary Putnam. On the notational independence of various hierarchies of degrees of unsolvability. The journal of symbolic logic, vol. 30 , pp. 69–86.Ylannis N. Moschovakis - 1967 - Journal of Symbolic Logic 32 (1):124-125.
A Note on Constructible Sets of Integers.Richard Mansfield - 1971 - Journal of Symbolic Logic 36 (2):339-340.
Index sets and degrees of unsolvability.Michael Stob - 1982 - Journal of Symbolic Logic 47 (2):241-248.
George Boolos (ed.), Meaning and Method: Essays in Honor of Hilary Putnam.Y. Levin - 1996 - Minds and Machines 6:434-438.
Busy Beaver sets and the degrees of unsolvability.Robert P. Daley - 1981 - Journal of Symbolic Logic 46 (3):460-474.
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1967 - Journal of Symbolic Logic 32 (4):528-528.
Analytics
Added to PP
2009-01-28
Downloads
233 (#89,246)
6 months
4 (#1,005,098)
2009-01-28
Downloads
233 (#89,246)
6 months
4 (#1,005,098)
Historical graph of downloads
Citations of this work
A degree-theoretic definition of the ramified analytical hierarchy.Carl G. Jockusch & Stephen G. Simpson - 1976 - Annals of Mathematical Logic 10 (1):1-32.
Gaps in the contructable universe.W. Marek & M. Srebrny - 1974 - Annals of Mathematical Logic 6 (3-4):359-394.
In Memoriam: George Stephen Boolos 1940–1996.Warren Goldfarb - 1996 - Bulletin of Symbolic Logic 2 (4):444-447.
Constructible β‐models.Herbert B. Enderton - 1973 - Mathematical Logic Quarterly 19 (14‐18):277-282.
An application of recursion theory to analysis.Liang Yu - 2020 - Bulletin of Symbolic Logic 26 (1):15-25.
References found in this work
Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.
A note on constructible sets of integers.Hilary Putnam - 1963 - Notre Dame Journal of Formal Logic 4 (4):270-273.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-xdvnm uwo