On n-quantifier induction

DOI10.2307/2272731zbMath0264.02027OpenAlexW2074448200MaRDI QIDQ5680103

Charles Parsons

Publication date: 1972

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272731

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Proof theory and constructive mathematics (03F99)

Related Items (43)

, , AND REINHARDT’S PROGRAM ⋮ Recursively saturated nonstandard models of arithmetic ⋮ How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study ⋮ Elementary descent recursion and proof theory ⋮ Majorizing provably recursive functions in fragments of PA ⋮ Unnamed Item ⋮ Herbrand analyses ⋮ Term extraction and Ramsey's theorem for pairs ⋮ Induction rules, reflection principles, and provably recursive functions ⋮ On extracting variable Herbrand disjunctions ⋮ Transfer and a supremum principle for ERNA ⋮ AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW ⋮ Provability and interpretability logics with restricted realizations ⋮ The finitary content of sunny nonexpansive retractions ⋮ Parameter free induction and provably total computable functions ⋮ On axiom schemes for \(T\)-provably \(\Delta_1\) formulas ⋮ Things that can and things that cannot be done in PRA ⋮ Proof Theoretic Analysis by Iterated Reflection ⋮ Primitive recursive selection functions for existential assertions over abstract algebras ⋮ Verificationism and Classical Realizability ⋮ Fast growing functions based on Ramsey theorems ⋮ Bounded functional interpretation ⋮ Pa-Beweisbare ∀∃-Formeln ⋮ A complexity analysis of functional interpretations ⋮ A simple proof of Parsons' theorem ⋮ Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA ⋮ On the computational content of the Bolzano-Weierstraß Principle ⋮ Corrected upper bounds for free-cut elimination ⋮ On the No-Counterexample Interpretation ⋮ INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES ⋮ Theoretical computer science: computational complexity ⋮ Theory of proofs (arithmetic and analysis) ⋮ Remarks on Herbrand normal forms and Herbrand realizations ⋮ Complexity of Gödel’s T in λ-Formulation ⋮ On the induction schema for decidable predicates ⋮ Axiomatizing Kripke's theory of truth ⋮ A note on parameter free Π₁ -induction and restricted exponentiation ⋮ Fragments of arithmetic ⋮ The optimality of induction as an axiomatization of arithmetic ⋮ The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) ⋮ On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness ⋮ Unprovability results for clause set cycles ⋮ On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising

Cites Work

• Nested recursion
• Intensional interpretations of functionals of finite type I
• Simultane Rekursionen in der Theorie der Funktionale endlicher Typen

This page was built for publication: On n-quantifier induction