Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14694
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/15921
http://dx.doi.org/10.14279/depositonce-14694
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Johannes Zawacki, my high school teacher, told us about Gödel's second theorem, on non-provability of consistency of mathematics within mathematics. Bonmot of André Weil: Dieu existe parceque la Mathématique est consistente, et le diable existe parceque nous ne pouvons pas prouver cela - God exists since Mathematics is consistent, and the devil exists since we cannot prove that. The problem with 19th/20th century mathematical foundations, clearly stated in Skolem 1919, is unbound in nitistic (non-constructive) formal existential quanti cation. In his 1973 Oberwolfach talk André Joyal sketched a categorical - map based - version of the Gödel theorems. A categorical version of the unrestricted non-constructive existential quanti er was still inherent. The consistency formula of set theory (and of arbitrary quanti ed arithmetical theories), namely: not exists a proof code for (the code of ) false, can be introduced as a (primitive) recursive - Gödel 1931 - free variable predicate: "For all arithmetised proofs k : k does not prove (code of) false:" Language restriction to the constructive (categorical) free-variables theory PR of primitive recursion or appropriate extensions opens the possibility to circumvent the two Gödel's incompleteness issues: We discuss iterative map code evaluation in direction of (termination conditioned) soundness, and based on this, decidability of primitive recursive predicates. In combination with Gödel's classical theorems this leads to unexpected consequences, namely to consistency provability and logical soundness for recursive descent theory πR : theory of primitive recursion strengthened by an axiom schema of non-in nite descent, descent in complexity of complexity controlled iterations like in particular (iterative) p.r.-map-code evaluation. We show an antithesis to Weil's above: Set theoretically God need not to exist, since his - Bourbaki's - "Theorie des Ensembles" is inconsistent. The devil does not need to exist, since we can prove inside free-variables recursive mathematics this mathematics consistency formula. By the same token God may exist.
Subject(s): primitive recursion
categorical free-variables Arithmetic
code evaluation
Stimmigkeit
soundness
decidability of PR predicates
Goedel theorems
self-inconsistency of quantified arithmetical theories
Issue Date: 1-Jan-2019
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: categorical logic
topoi
foundations of classical theories
axiomatic computability
recursion theory
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2019, 03
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-03-2019.pdf
Format: Adobe PDF | Size: 1.02 MB
DownloadShow Preview
Thumbnail

Item Export Bar

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