PhilArchive
open access
Defining Gödel Incompleteness Away
We can simply define Gödel 1931 Incompleteness away by redefining the meaning of the standard definition of Incompleteness: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). This definition construes the existence of self-contradictory expressions in a formal system as proof that this formal system is incomplete because self-contradictory expressions are neither provable nor disprovable in this formal system. Since self-contradictory expressions are neither provable nor disprovable only because they are self-contradictory we could define them as unsound instead of defining the formal system as incomplete.
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
- Structural Severance: A Formal Analysis of the Exogenous Executive Necessity in Rational Systems#94513
- Kasei-Theory I.Impossibility: Impossibility Without Negation#693612
- Systematic construction of natural deduction systems for many-valued logics#733267
- Kasei-Theory I.End: End Without Termination#694273
- Três Vezes Não: Um Estudo Sobre as Negações Clássica, Paraconsistente e Paracompleta#737528
Record · ID 757814
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