On n-quantifier induction

Journal of Symbolic Logic 37 (3):466-482 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272731

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,867

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Charles Parsons, A. Kino, J. Myhill, R. E. Vesley, On a Number Theoretic Choice Schema and its Relation to Induction; Charles Parsons, Review of the Foregoing; Charles Parsons, On $n$-Quantifier Induction. [REVIEW]Helmut Schwichtenberg - 1974 - Journal of Symbolic Logic 39 (2):342-342.
Charles Parsons. On a number theoretic choice schema and its relation to induction. Intuitionism and proof theory, Proceedings of the summer conference at Buffalo N.Y. 1968, edited by A. Kino, J. Myhill, and R. E. Vesley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam and London 1970, pp. 459–473. - Charles Parsons. Review of the foregoing. Zentralblatt für Mathematik and ihre Grenzgebiete, vol. 202 , pp. 12–13. - Charles Parsons. On n-quantifier induction. The journal of symbolic logic, vol. 37 , pp. 466–482. [REVIEW]Helmut Schwichtenberg - 1974 - Journal of Symbolic Logic 39 (2):342.
On the quantifier complexity of Δ n+1 (T)– induction.A. Cordón-Franco, A. Fernández-Margarit & F. F. Lara-Martín - 2004 - Archive for Mathematical Logic 43 (3):371-398.
Review: Charles N. Delzell, Note on Quantifier Prefixes Over Diophantine Equations; J. P. Jones, H. Levitz, A. J. Wilkie, Classification of Quantifier Prefixes over Exponential Diophantine Equations. [REVIEW]Shih Ping Tung - 1988 - Journal of Symbolic Logic 53 (1):309-310.
On 퐧-Quantifier Induction.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (3):466 - 482.
Recursion in a quantifier vs. elementary induction.Phokion G. Kolaitis - 1979 - Journal of Symbolic Logic 44 (2):235-259.
Review: Charles Parsons, Hierarchies of Primitive Recursive Functions. [REVIEW]C. F. Kent - 1971 - Journal of Symbolic Logic 36 (3):538-539.
Review: Charles Parsons, The $omega$-Consistency of Ramified Analysis. [REVIEW]Gert H. Muller - 1965 - Journal of Symbolic Logic 30 (1):94-94.
Review: Charles Parsons, A Note on Quine's Treatment of Transfinite Recursion. [REVIEW]G. T. Kneebone - 1972 - Journal of Symbolic Logic 37 (4):769-769.
Charles Parsons. A note on Quine's treatment of transfinite recursion. The journal of symbolic logic, vol. 29 no. 4 , pp. 179–182.G. T. Kneebone - 1972 - Journal of Symbolic Logic 37 (4):769.

Analytics

Added to PP
2016-06-30

Downloads
23 (#670,463)

6 months
14 (#254,087)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Charles Parsons
Harvard University

Citations of this work

Fragments of arithmetic.Wilfried Sieg - 1985 - Annals of Pure and Applied Logic 28 (1):33-71.
KF, PKF and Reinhardt’s Program.Luca Castaldo & Johannes Stern - 2022 - Review of Symbolic Logic (1):33-58.
Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.
Elementary descent recursion and proof theory.Harvey Friedman & Michael Sheard - 1995 - Annals of Pure and Applied Logic 71 (1):1-45.

View all 25 citations / Add more citations

References found in this work

Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.
Interpretation of analysis by means of constructive functionals of finite types.Georg Kreisel - 1959 - In A. Heyting (ed.), Constructivity in mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 101--128.

Add more references