- 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 for hat inductive definitions in arithmetic
Mathematical Logic Quarterly 60 (4-5):314-318 (2014)
Abstract
By forcing, we give a direct interpretation of into Avigad's. To the best of the author's knowledge, this is one of the simplest applications of forcing to “real problems”.Other Versions
No versions found
My notes
Similar books and articles
Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20-22):341-352.
Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20‐22):341-352.
Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.
Arithmetical Sacks Forcing.Rod Downey & Liang Yu - 2006 - Archive for Mathematical Logic 45 (6):715-720.
Bounded Namba forcing axiom may fail.Jindrich Zapletal - 2018 - Mathematical Logic Quarterly 64 (3):170-172.
A Note On The Axiomatisation Of Real Numbers.Thierry Coquand & L. Henri Lombardi - 2008 - Mathematical Logic Quarterly 54 (3):224-228.
Sacks forcing, Laver forcing, and Martin's axiom.Haim Judah, Arnold W. Miller & Saharon Shelah - 1992 - Archive for Mathematical Logic 31 (3):145-161.
Projective absoluteness for Sacks forcing.Daisuke Ikegami - 2009 - Archive for Mathematical Logic 48 (7):679-690.
Provably recursive functions of constructive and relatively constructive theories.Morteza Moniri - 2010 - Archive for Mathematical Logic 49 (3):291-300.
Forcing operators on MTL-algebras.George Georgescu & Denisa Diaconescu - 2011 - Mathematical Logic Quarterly 57 (1):47-64.
Analytics
Added to PP
2015-09-03
Downloads
23 (#952,686)
6 months
6 (#901,624)
2015-09-03
Downloads
23 (#952,686)
6 months
6 (#901,624)
Historical graph of downloads
Citations of this work
A new model construction by making a detour via intuitionistic theories IV: A closer connection between KPω and BI.Kentaro Sato - 2024 - Annals of Pure and Applied Logic 175 (7):103422.
A new model construction by making a detour via intuitionistic theories III: Ultrafinitistic proofs of conservations of Σ 1 1 collection. [REVIEW]Kentaro Sato - 2023 - Annals of Pure and Applied Logic 174 (3):103207.
References found in this work
Does reductive proof theory have a viable rationale?Solomon Feferman - 2000 - Erkenntnis 53 (1-2):63-96.
On the relationship between ATR 0 and.Jeremy Avigad - 1996 - Journal of Symbolic Logic 61 (3):768-779.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.
Forcing under Anti‐Foundation Axiom: An expression of the stalks.Sato Kentaro - 2006 - Mathematical Logic Quarterly 52 (3):295-314.
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-667477cd97-sfdq8 dc2