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: 91,628

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

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 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.
On 퐧-Quantifier Induction.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (3):466 - 482.
A model theory of induction.Philip N. Johnson‐Laird - 1994 - International Studies in the Philosophy of Science 8 (1):5 – 29.
Some Results on LΔ — n+1.Alejandro Fernández Margarit & F. Félix Lara Martin - 2001 - Mathematical Logic Quarterly 47 (4):503-512.
Three quantifier sentences.Harvey Friedman - manuscript
Recursion in a quantifier vs. elementary induction.Phokion G. Kolaitis - 1979 - Journal of Symbolic Logic 44 (2):235-259.
Induction and Inductive Definitions in Fragments of Second Order Arithmetic.Klaus Aehlig - 2005 - Journal of Symbolic Logic 70 (4):1087 - 1107.
Non-effective Quantifier Elimination.Mihai Prunescu - 2001 - Mathematical Logic Quarterly 47 (4):557-562.
On diophantine equations solvable in models of open induction.Margarita Otero - 1990 - Journal of Symbolic Logic 55 (2):779-786.
Theory discovery from data with mixed quantifiers.Kevin T. Kelly & Clark Glymour - 1990 - Journal of Philosophical Logic 19 (1):1 - 33.
Preservation theorems for bounded formulas.Morteza Moniri - 2007 - Archive for Mathematical Logic 46 (1):9-14.
Transfinite induction within Peano arithmetic.Richard Sommer - 1995 - Annals of Pure and Applied Logic 76 (3):231-289.
Quantifier Variance and the Collapse Argument.Jared Warren - 2015 - Philosophical Quarterly 65 (259):241-253.
Fragments of Arithmetic and true sentences.Andrés Cordón-Franco, Alejandro Fernández-Margarit & F. Félix Lara-Martín - 2005 - Mathematical Logic Quarterly 51 (3):313-328.

Analytics

Added to PP
2016-06-30

Downloads
22 (#705,136)

6 months
13 (#190,565)

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.
Herbrand analyses.Wilfried Sieg - 1991 - Archive for Mathematical Logic 30 (5-6):409-441.

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.

Add more references