Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14594
For citation please use:
Main Title: Arithmetical Foundations Recursion. Evaluation. Consistency
Author(s): Pfender, Michael
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15821
http://dx.doi.org/10.14279/depositonce-14594
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Recursive maps, nowadays called primitive recursive maps, p. r. maps, have been introduced by Gödel in his 1931 article for the arithmetisation, gödelisation, of metamathematics. For construction of his undecidable formula he introduces a nonconstructive, non-recursive predicate beweisbar, provable. Staying within the area of (categorical) free-variables theory PR of primitive recursion or appropriate extensions opens the chance to avoid the two Gödel's incompleteness theorems: these are stated for Principia Mathematica und verwandte Systeme, "related systems" such as in particular Zermelo-Fraenkel set theory ZF and v. Neumann Gödel Bernays set theory NGB. On the basis of primitive recursion we consider μ-recursive maps as partial p. r. maps. Special terminating general recursive maps considered are complexity controlled iterations. Map code evaluation for PR is given in terms of such an iteration. We discuss iterative map code evaluation in direction of termination conditioned soundness, and based on this mu-recursive decision of primitive recursive predicates. This leads to consistency provability and soundness for classical, quanti ed arithmetical and set theories as well as for the p. r. descent theory theory πR, with unexpected consequences: We show inconsistency provability for the quanti ed theories, as well as consistency provability and logical soundness for the theory πR of primitive recursion, strengthened by an axiom scheme of non-infinite descent of complexity controlled iterations like (iterative) mapcode evaluation.
Subject(s): primitive recursion
mu-recursion
code evaluation
complexity controlled iteration
soundness
decidability
Gödel theorems
inconsistency provability for set theory
constructive consistency
Issue Date: 28-May-2014
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 03G30 Categorical logic, topoi
03B30 Foundations of classical theories
03D75 Abstract and axiomatic computability and recursion theory
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2014, 08
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Preprint-8-2014.pdf
Format: Adobe PDF | Size: 1.33 MB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.