Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14503
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/15730
http://dx.doi.org/10.14279/depositonce-14503
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Gödel Theorems revisited. Categorical free-variables theory of Primitive Recursion and of mu-recursion. Definition of evaluation of PR codes as Complexity Controlled Iteration, introduction of a theory piR of non-infinite descent of such iterations. (Termination conditioned) Soundness of evaluation. Decidability of PR free-variable predicates. Decidability of Consistency formulae for piR and set theory as special cases. omega-inconsistency of set theory and derivability of consistency formula for Descent theory piR as consequences.
Subject(s): Gödel Theorems
categorical recursion
decidability
consistency provability
Issue Date: 21-Dec-2012
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: 2012, 38
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-38-2012.pdf
Format: Adobe PDF | Size: 1.34 MB
DownloadShow Preview
Thumbnail

Item Export Bar

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