A simple proof of Parsons' theorem
type: Item
instance of: scholarly article
title: A simple proof of Parsons' theorem
zbMATH Open document ID: 1095.03063
author: Fernando Ferreira
published in: Notre Dame Journal of Formal Logic
publication date: 2005-07-06T00:00:00Z
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03D20
zbMATH DE Number: 2186752
zbMATH Keywords: finitism
zbMATH Keywords: Hilbert's program
zbMATH Keywords: conservativeness
zbMATH Keywords: primitive recursive arithmetic
zbMATH Keywords: fragment of Peano arithmetic
zbMATH Keywords: provably total functions
zbMATH Keywords: primitive recursive functions
zbMATH Keywords: universal theories
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1305/ndjfl/1107220675
OpenAlex ID: W2008055057
cites work: Saturated models of universal theories
cites work: Q3794177
cites work: Logic and computational complexity. International workshop, LCC '94, Indianapolis, IN, USA, October 13-16, 1994. Selected Papers
cites work: Q4215631
cites work: A Formalization of Recursive Arithmetic
cites work: Q4793426
cites work: Q3487327
cites work: Function Theory in an Axiom-Free Equation Calculus
cites work: Q5573940
cites work: Grundlagen der Mathematik I
cites work: Q4138726
cites work: Bounded arithmetic and the polynomial hierarchy
cites work: Quantifier-free and one-quantifier systems
cites work: Q5600870
cites work: On n-quantifier induction
cites work: Fragments of arithmetic
cites work: Herbrand analyses
cites work: Partial realizations of Hilbert's program
cites work: Q4220572
cites work: Handbook of mathematical logic. With the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, A. S. Troelstra. 2nd printing
cites work: Q4793041
cites work: Proof theory
cites work: Q4499084
cites work: Constructivism in mathematics. An introduction. Volume I
DOI: 10.1305/NDJFL/1107220675
description: scientific article; zbMATH DE number 2186752