2009/01/30 by Michael Pfender, Pfender, Michael
Computer Science · #03B30 #03G30 #Advanced Algebra and Logic #Category Theory (math.CT) #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Logic, programming, and type systems
paper · pdf · doi:10.48550/arxiv.0901.4865
openalex publication_date 2009/01/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We exhibit canonical middle-inverse Choice maps within categorical (Free-Variable) Theory of Primitive Recursion as well as in Theory of partial PR maps over the Theory of Primitive Recursion with predicate abstraction. Using these choice-maps, defined by mu-recursion, we address the Consistency problem for a minimal Quantified extension Q of latter two theories: We prove, that Q's exists-defined mu-operator coincides on PR predicates with that inherited from theory of partial PR maps. We strengthen Theory Q by axiomatically forcing the lexicographical order on its omegaomega to become a well-order: "finite descent". Resulting theory admits non-infinit PR-iterative descent schema (pi) which constitutes Cartesian PR Theory piR introduced in RCF2: Evaluation and Consistency. A suitable Cartesian subSystem of Q + wo(omegaomega) above, extension of piR "inside" Theory Q + wo(omegaomega), is shown to admit code self-evaluation: extension of formally partial code evaluation of piR into a "total" self-evaluation for the subSystem. Appropriate diagonal argument then shows inconsistency of this subsystem and (hence) of its extensions Q + wo(omegaomega) and ZF.