Arithmetical Foundations - Recursion. Evaluation. Consistency

2013/12/10 by Pfender, Michael
#03B30 #03D75 #03G30 #Category Theory (math.CT) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.1312.7275

Abstract

Primitive recursion, mu-recursion, universal object and universe theories, complexity controlled iteration, code evaluation, soundness, decidability, Gödel incompleteness theorems, inconsistency provability for set theory, constructive consistency.

Related

• Consistency Decision
• Inconsistency of Primitive Recursive Arithmetic
• Computable Quantification in Reflective Grounded Arithmetic
• Recursive Synthesis and the Foundations of Mathematics
• The Arithmetical Hierarchy: A Realizability-Theoretic Perspective