A simple proof of Parsons' theorem

DOI10.1305/NDJFL/1107220675MaRDI QIDQ558443zbMATH OpenOpenAlexFDO

Authors Fernando Ferreira

Publication date 6 July 2005

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1107220675

zbMATH Keywords

conservativenessfinitismprimitive recursive functionsfragment of Peano arithmeticHilbert's programprimitive recursive arithmeticprovably total functionsuniversal theories

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
• A proof-theoretic characterization of the primitive recursive set functions
• Grzegorcyk's hierarchy and IepΣ₁
• Local induction and provably total computable functions
• Functions provably total in $I^{-}Σ_{n}$

Cites work

• scientific article; zbMATH DE number 4160708 (Why is no real title available?)
• scientific article; zbMATH DE number 4059391 (Why is no real title available?)
• scientific article; zbMATH DE number 3566838 (Why is no real title available?)
• scientific article; zbMATH DE number 1215494 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 1497485 (Why is no real title available?)
• scientific article; zbMATH DE number 1870429 (Why is no real title available?)
• scientific article; zbMATH DE number 1867332 (Why is no real title available?)
• scientific article; zbMATH DE number 3291106 (Why is no real title available?)
• scientific article; zbMATH DE number 3320380 (Why is no real title available?)
• A Formalization of Recursive Arithmetic
• Bounded arithmetic and the polynomial hierarchy
• Constructivism in mathematics. An introduction. Volume I
• Fragments of arithmetic
• Function Theory in an Axiom-Free Equation Calculus
• Grundlagen der Mathematik I
• Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing
• Herbrand analyses
• Logic and computational complexity. International workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers
• On n-quantifier induction
• Partial realizations of Hilbert's program
• Proof theory
• Quantifier-free and one-quantifier systems
• Saturated models of universal theories

Cited in

(10)

• On Σ₁‐definable Functions Provably Total in I ∏
• Pa-Beweisbare ∀∃-Formeln
• An elementary proof of strong normalization for atomic \(\mathsf F\)
• A simple proof of a theorem of Parish
• Harrington's conservation theorem redone
• Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
• On a Problem of J. Paris
• Eliminating disjunctions by disjunction elimination
• Local induction and provably total computable functions: a case study
• Another Simple Proof of Pascal’s Theorem

This page was built for publication: A simple proof of Parsons' theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558443)