Pfender, MichaelNguyen, C.C.Sablatnig, J.2021-12-172021-12-172020-07-282197-8085https://depositonce.tu-berlin.de/handle/11303/15925http://dx.doi.org/10.14279/depositonce-14698We introduce in an axiomatic way the categorical theory PR of primitive recursion as the initial cartesian category with Natural Numbers Object. This theory has an extension into constructive set theory S of primitive recursion with abstraction of predicates into subsets and two-valued (boolean) truth algebra. Within the framework of (typical) classical, quantified set theory T we construct an evaluation of arithmetised theory PR via Complexity Controlled Iteration with witnessed termination of the iteration, witnessed termination by availability of Hilbert s iota operator in set theory. Objectivity of that evaluation yields inconsistency of set theory T by a liar (anti)diagonal argument.en510 Mathematikclassical first-order logicGoedel numberingsissues of incompletenessfoundationsdeductive systemsResearch Paper