arXiv (All)
open access
Inductive Grounded Arithmetic: Goodstein, the Hydra, and $Γ_0$
What does a recursive definition mean when the logic is grounded, so a sentence is true only if a terminating process makes it so? Kripke's answer for the special case of truth was the least fixed point. This paper takes that answer as a rule. Reflective Grounded Arithmetic (RGA) already writes any
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Semantics for the Impure Logic of Ground#707192
- Yet Another Puzzle of Ground#746014
- The Recursive Actuation Mandate: Semiotic Closure of the G − I Cycle and Universal Underdetermination#81473
- Prolog detects pathological self reference in the Gödel sentence#757824
- Structural Severance: A Formal Analysis of the Exogenous Executive Necessity in Rational Systems#94513
Record · ID 1457702
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive