✦ LIBER ✦

Von Neumann, Gödel and complexity theory

✍ Scribed by Urquhart, Alasdair

Book ID: 125493104
Publisher: JSTOR
Year: 2010
Tongue: English
Weight: 129 KB
Volume: 16
Category: Article
ISSN: 1079-8986
DOI: 10.2178/bsl/1294171130

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Axiomatics for Nonstandard Set Theory

An Axiomatics for Nonstandard Set Theory, Based on Von Neumann-Bernays-Gödel Theory

✍ P. V. Andreev and E. I. Gordon 📂 Article 📅 2001 🏛 Association for Symbolic Logic 🌐 English ⚖ 408 KB

Bernays–Gödel type theory

✍ Carsten Butz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Von Neumann Theory Prize Citation

📂 Article 📅 1977 🏛 INFORMS 🌐 English ⚖ 151 KB

Computational complexity and Gödel's inc

Computational complexity and Gödel's incompleteness theorem

✍ Chaitin, G. J. 📂 Article 📅 1971 🏛 Association for Computing Machinery ⚖ 120 KB

Computational complexity and Gödel's inc

Computational complexity and Gödel's incompleteness theorem

✍ 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

Completeness and categoricity: Frege, gö

Completeness and categoricity: Frege, gödel and model theory

✍ Read, Stephen 📂 Article 📅 1997 🏛 Taylor and Francis Group 🌐 English ⚖ 849 KB