A simple proof of Parsons' theorem

DOI10.1305/ndjfl/1107220675zbMath1095.03063OpenAlexW2008055057MaRDI QIDQ558443

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

conservativenessprimitive recursive arithmeticuniversal theoriesfinitismprimitive recursive functionsfragment of Peano arithmeticHilbert's programprovably total functions

Mathematics Subject Classification ID

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

Related Items

Eliminating disjunctions by disjunction elimination, Elementary Proof of Strong Normalization for Atomic F, Harrington's conservation theorem redone

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fragments of arithmetic
• Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing
• Bounded arithmetic and the polynomial hierarchy
• Constructivism in mathematics. An introduction. Volume I
• 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
• Partial realizations of Hilbert's program
• Grundlagen der Mathematik I
• On n-quantifier induction
• A Formalization of Recursive Arithmetic
• Function Theory in an Axiom-Free Equation Calculus
• Proof theory