Computability and Formalization Challenge
F16
foundations logic
foundations logic
External: philosophical foundational debate
τ response: partially addressed
Can the foundation be represented in proof assistants without losing its intended semantics, and what exactly is checked by the formalization?
Current τ response
See the paired Computability and Formalization Challenge — Challenge Response on the Results lane for the program's current response status, registry evidence, verification route, and external-review boundary.
Current status: partially addressed.
Challenge statement
Can the foundation be represented in proof assistants without losing its intended semantics, and what exactly is checked by the formalization?
Why this challenge is in the ledger
Modern foundations increasingly interact with proof assistants. τ already has TauLib, so this challenge is canonical.
τ-facing burden
Specify what TauLib verifies, what it encodes, what remains prose-level, where bridge claims exceed formal proof, and how Lean’s ambient foundations relate to τ’s intended foundations.
First reviewer questions
- How does τ position itself with respect to computability and formalization challenge?
- Are τ's claims here theorem-like, programmatic, or descriptive?
- What external review would settle the open questions?
Source anchors
Source anchors are background references, not endorsements of Panta Rhei claims.