Existence and feasibility in arithmetic
Journal of Symbolic Logic 36 (3):494-508 (1971)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
On the derivability of instantiation properties.Harvey Friedman - 1977 - Journal of Symbolic Logic 42 (4):506-514.
Classical arithmetic as part of intuitionistic arithmetic.Michael Potter - 1998 - Grazer Philosophische Studien 55 (1):127-41.
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
The feasibility of basic socioeconomic human rights: A conceptual exploration.Pablo Gilabert - 2009 - Philosophical Quarterly 59 (237):659-681.
Analytics
Added to PP
2009-01-28
Downloads
84 (#147,153)
6 months
2 (#297,737)
2009-01-28
Downloads
84 (#147,153)
6 months
2 (#297,737)
Historical graph of downloads
Author's Profile
Citations of this work
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
The logic of justified belief, explicit knowledge, and conclusive evidence.Alexandru Baltag, Bryan Renne & Sonja Smets - 2014 - Annals of Pure and Applied Logic 165 (1):49-81.
Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals.Ulrich Kohlenbach - 1996 - Archive for Mathematical Logic 36 (1):31-71.
A universal approach to self-referential paradoxes, incompleteness and fixed points.Noson S. Yanofsky - 2003 - Bulletin of Symbolic Logic 9 (3):362-386.
References found in this work
Philosophy of Mathematics.Paul Benacerraf & Hilary Putnam - 1985 - Philosophy of Science 52 (3):488-489.