PhilArchive
open access
Well Founded Justification Trees in Proof Theoretic Semantics applied to the Liar Paradox and the Halting Problem Input
This paper explores how the proof theoretic notion of well founded justification trees resolves two of the most well-known instances of self-referential undecidability.
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
- Proof Theoretic Semantics Blocks Pathological Self-Reference#96585
- Counterevidentials#77175
- The Theory of Boolean Counterfactual Reasoning#699811
- Zero-Knowledge Predicate Proofs Between AI Agents: A Measured, Cross-Protocol Gateway and the Source-Integrity Gap#622452
- The Semantic Obligations of Strong Universal Claims: An Evoluist Theorem of Audit-Domain Completeness#690592
Record · ID 733597
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