- 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
On the Equivalence Between Logic‐Free and Logic‐Bearing Systems of Primitive Recursive Arithmetic
Mathematical Logic Quarterly 33 (3):245-253 (1987)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
Strictly Primitive Recursive Realizability, II. Completeness with Respect to Iterated Reflection and a Primitive Recursive $\omega$ -Rule.Zlatan Damnjanovic - 1998 - Notre Dame Journal of Formal Logic 39 (3):363-388.
Review: R. L. Goodstein, Recursive Number Theory. A Development of Recursive Arithmetic in a Logic-Free Equation Calculus. [REVIEW]Th Skolem - 1958 - Journal of Symbolic Logic 23 (2):227-228.
Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM.Osamu Takaki - 2005 - Archive for Mathematical Logic 44 (6):689-709.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
A Free‐Variable Theory of Primitive Recursive Arithmetic.Daniel G. Schwartz - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (2):147-157.
Intuitionistic Choice and Restricted Classical Logic.Ulrich Kohlenbach - 2001 - Mathematical Logic Quarterly 47 (4):455-460.
Closed fragments of provability logics of constructive theories.Albert Visser - 2008 - Journal of Symbolic Logic 73 (3):1081-1096.
Existentially Complete Nerode Semirings.Thomas G. McLaughlin - 1995 - Mathematical Logic Quarterly 41 (1):1-14.
Review: R. L. Goodstein, Logic-free Formalisations of Recursive Arithmetic. [REVIEW]Rózsa Péter - 1959 - Journal of Symbolic Logic 24 (3):245-246.
Equivalence of some Hierarchies of Primitive Recursive Functions.Keith Harrow - 1979 - Mathematical Logic Quarterly 25 (25‐29):411-418.
Strictly primitive recursive realizability, I.Zlatan Damnjanovic - 1994 - Journal of Symbolic Logic 59 (4):1210-1227.
König's lemma, the ω-Rule and primitive recursive arithmetic.E. G. K. López-Escobar - 1985 - Archive for Mathematical Logic 25 (1):67-74.
The Ackermann functions are not optimal, but by how much?H. Simmons - 2010 - Journal of Symbolic Logic 75 (1):289-313.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Analytics
Added to PP
2013-12-01
Downloads
18 (#811,325)
6 months
3 (#992,474)
2013-12-01
Downloads
18 (#811,325)
6 months
3 (#992,474)
Historical graph of downloads
Citations of this work
The Closed Fragment of the Interpretability Logic of PRA with a Constant for $\mathrm{I}\Sigma_1$.Joost J. Joosten - 2005 - Notre Dame Journal of Formal Logic 46 (2):127-146.
References found in this work
Recursive Number Theory. A Development of Recursive Arithmetic in a Logic-Free Equation Calculus.R. L. Goodstein - 1958 - Journal of Symbolic Logic 23 (2):227-228.
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-7c76586df8-l2pxr uwo