- 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
Some applications of forcing to hierarchy problems in arithmetic
Mathematical Logic Quarterly 15 (20-22):341-352 (1969)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Forcing for hat inductive definitions in arithmetic.Kentaro Sato - 2014 - Mathematical Logic Quarterly 60 (4-5):314-318.
Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.
Peter G. Hinman. Hierarchies of effective descriptive set theory. Transactions of the American Mathematical Society, vol. 142 , pp. 111–140. [REVIEW]Yiannis N. Moschovakis - 1972 - Journal of Symbolic Logic 37 (4):758-759.
Peter G. Hinman. Recursion-theoretic hierarchies. Perspectives in mathematical logic. Springer-Verlag, Berlin, Heidelberg, and New York, 1978, XII + 480 pp. [REVIEW]Wayne Richter - 1983 - Journal of Symbolic Logic 48 (2):497-498.
Some applications of almost disjoint forcing.R. B. Jensen & R. M. Solovay - 1970 - In Yehoshua Bar-Hillel (ed.), Mathematical logic and foundations of set theory. Amsterdam,: North-Holland Pub. Co..
The polynomial and linear time hierarchies in V0.Leszek A. Kołodziejczyk & Neil Thapen - 2009 - Mathematical Logic Quarterly 55 (5):509-514.
A saturation property of structures obtained by forcing with a compact family of random variables.Jan Krajíček - 2013 - Archive for Mathematical Logic 52 (1-2):19-28.
Some Properties of the Extended Hyperprojective Hierarchy.Eliot D. Feldman - 1972 - Mathematical Logic Quarterly 18 (4‐6):55-60.
Refining the arithmetical hierarchy of classical principles.Makoto Fujiwara & Taishi Kurahashi - 2022 - Mathematical Logic Quarterly 68 (3):318-345.
Analytics
Added to PP
2013-11-24
Downloads
74 (#284,474)
6 months
15 (#210,649)
2013-11-24
Downloads
74 (#284,474)
6 months
15 (#210,649)
Historical graph of downloads
Citations of this work
Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers.Carl G. Jockusch & Richard A. Shore - 1984 - Journal of Symbolic Logic 49 (4):1205 - 1236.
Complexity of the -query Tautologies in the Presence of a Generic Oracle.Toshio Suzuki - 2000 - Notre Dame Journal of Formal Logic 41 (2):142-151.
Measure and category in effective descriptive set theory.Alexander S. Kechris - 1973 - Annals of Mathematical Logic 5 (4):337.
References found in this work
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
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-648784bb4d-f5f4x uwo