- 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
Forcing and reducibilities
Journal of Symbolic Logic 48 (2):288-310 (1983)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
Links
PhilArchive
External links
- From the Publisher via CrossRef (no proxy)
- projecteuclid.org
(no proxy) - projecteuclid.org [2] (no proxy)
- projecteuclid.org [3] (no proxy)
- projecteuclid.org [4] (no proxy)
- projecteuclid.org [5] (no proxy)
- journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- jstor.org [4] (no proxy)
- jstor.org [5] (no proxy)
- cambridge.org (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
Forcing and reducibilities. II. forcing in fragments of analysis.Piergiorgio Odifreddi - 1983 - Journal of Symbolic Logic 48 (3):724-743.
Forcing and reducibilities. III. forcing in fragments of set theory.Piergiorgio Odifreddi - 1983 - Journal of Symbolic Logic 48 (4):1013-1034.
Piergiorgio Odifreddi. Classical recursion theory. The theory of functions and sets of natural numbers. Studies in logic and the foundations of mathematics, vol. 125. North-Holland, Amsterdam etc. 1989, xvii + 668 pp. [REVIEW]Peter G. Hinman - 1990 - Journal of Symbolic Logic 55 (3):1307-1308.
Logic and computer science, edited by Piergiorgio Odifreddi, APIC studies in data processing, vol. 31, Academic Press, London, San Diego, etc., 1990, xii + 430 pp. [REVIEW]Grigori Mints - 1994 - Journal of Symbolic Logic 59 (3):1111-1114.
Reducibilities in intuitionistic topology.Dirk Van Dalen - 1968 - Journal of Symbolic Logic 33 (3):412-417.
Reducibilities in two models for combinatory logic.Luis E. Sanchis - 1979 - Journal of Symbolic Logic 44 (2):221-234.
Anti-Complex Sets and Reducibilities with Tiny Use.Johanna N. Y. Franklin, Noam Greenberg, Frank Stephan & Guohua Wu - 2013 - Journal of Symbolic Logic 78 (4):1307-1327.
P. G. Odifreddi. Classical recursion theory. Volume II. Studies in logic and the foundations of mathematics, vol. 143. Elsevier, Amsterdam etc. 1999, xvi + 949 pp. [REVIEW]Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
Baire reductions and good Borel reducibilities.Luca Motto Ros - 2010 - Journal of Symbolic Logic 75 (1):323-345.
Analytics
Added to PP
2009-01-28
Downloads
238 (#107,711)
6 months
23 (#128,542)
2009-01-28
Downloads
238 (#107,711)
6 months
23 (#128,542)
Historical graph of downloads
Author's Profile
Citations of this work
Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.
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.
Non-Tightness in Class Theory and Second-Order Arithmetic.Alfredo Roque Freire & Kameryn J. Williams - forthcoming - Journal of Symbolic Logic:1-28.
On the decidability of the theories of the arithmetic and hyperarithmetic degrees as uppersemilattices.James S. Barnes - 2017 - Journal of Symbolic Logic 82 (4):1496-1518.
References found in this work
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
A degree-theoretic definition of the ramified analytical hierarchy.Carl G. Jockusch & Stephen G. Simpson - 1976 - Annals of Mathematical Logic 10 (1):1-32.
Reducibility orderings: Theories, definability and automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20-22):341-352.
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-7fcfcfd97b-wgl8x uwo