Scott, Steven (2025) Recursive Ontological Calculus: A Unified Theory of Symbolic Computation. [Preprint]
This is the latest version of this item.
![]() |
Text
Recursive Ontological Calculus - PREPRINT.pdf Download (434kB) |
Abstract
The Recursive Ontological Calculus (ROC) furnishes a complete, machine-verifiable axiomatisation of symbolic identity, curvature, and semantic recursion. Building directly on C. S. Peirce’s triadic conception of the sign, ROC links category-theoretic morphology with information-geometric entropy bounds. We present formal schemas, a sequent calculus equipped with an infinitary Master Recursion Equation, eleven core theorems (T1–T11), and cross-framework embeddings into ordinary category theory, ZFC, and Homotopy Type Theory. Worked examples demonstrate numeric curvature computation, gauge-orbit quantisation, and prime-gate symbolic statistics.
Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
Social Networking: |
Available Versions of this Item
-
Ontomorphic Peircean Calculus: A Universal Mathematical Framework for Identity, Logic, and Semantic Computation. (deposited 11 Jun 2025 14:30)
- Recursive Ontological Calculus: A Unified Theory of Symbolic Computation. (deposited 18 Jun 2025 14:20) [Currently Displayed]
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Altmetric.com
Actions (login required)
![]() |
View Item |