𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Gödel's Second Incompleteness Theorem for Q

✍ Scribed by A. Bezboruah and J. C. Shepherdson


Book ID
124972489
Publisher
Association for Symbolic Logic
Year
1976
Tongue
English
Weight
243 KB
Volume
41
Category
Article
ISSN
0022-4812

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Computational complexity and Gödel's inc
✍ Chaitin, G. J. 📂 Article 📅 1971 🏛 Association for Computing Machinery ⚖ 120 KB

Given any simply consistent formal theory F of the state complexity L(S) of finite binary sequences S as computed by 3-tape-symbol Turing machines, there exists a natural number L(F) such that L(S) > n is provable in F only if n < L(F). On the other hand, almost all finite binary sequences S satisfy