A simple proof of Parsons' theorem

DOI10.1305/NDJFL/1107220675zbMATH Open1095.03063OpenAlexW2008055057MaRDI QIDQ558443FDOQ558443

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

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}$

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)

Cites Work

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

Cited In (10)

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

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)