2--induction 0
Download:
|
|
by Induction Rule, Ulrich Kohlenbach
http://www.brics.dk/~kohlenb/Spri.ps
Add To MetaCart
Abstract:
It is well--known (due to C. Parsons) that the extension of primitive recursive arithmetic PRA by first--order predicate logic and the rule of # 0
Citations
| 34 | Theories of finite type related to mathematical practice – Feferman - 1977 |
| 33 | Hilbert's program relativized: proof-theoretical and foundational studies – Feferman - 1988 |
| 30 | On a number-theoretic choice schema and its relation to induction, in Intuitionism and Proof Theory: proceedings of the summer conference at Buffalo N.Y – Parsons - 1968 |
| 21 | Fragments of arithmetic – Sieg - 1985 |
| 20 | On n-quantifier induction – Parsons - 1972 |
| 18 | E#ective bounds from ine#ective proofs in analysis: an application of functional interpretation and majorization – Kohlenbach - 1992 |
| 6 | growth in standard parts of analysis. Habilitationsschrift – Kohlenbach, Real - 1995 |
| 3 | What can be done with PRA – Mints - 1980 |
| 2 | Constructions in classical analysis by unwinding proofs using majorizability (abstract, Logic Colloquium 89 – Kohlenbach - 1992 |
