PhilArchive
open access
Incompleteness and Computability: An Open Introduction to Gödel's Theorems
Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.
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
- On the Possibility of a Completeness Theorem: A Sketch of Fluctuational Completeness#733556
- Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics#105873
- On strong and weak logics for paraconsistent computability#701354
- Theory of Systems: A First-Principles Foundation for Mathematics#113841
- Remarks on Axiomatic Rejection in Aristotle’s Syllogistic#746617
Record · ID 721836
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