Gödel's Second Theorem for Elementary arithmetic
✍ Scribed by Lawrence J. Pozsgay
- Publisher
- John Wiley and Sons
- Year
- 1968
- Tongue
- English
- Weight
- 737 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
GUDECS
SECOND THEOREM FOR ELEMENTARY ARITHMETTC by LAWRENCE J. POZSGAY in St. Louis, Missouri (U.S.A.)I)
'"I' -+ q]" = " ; ') * Ps("P", (1)) ' PS("Q", ( 2 ) ) .
5.1. Dpfinition.
A number n will be called a functor number iff there is a fun(*tor P such that n = "E"'. Similarly define term number and formula number.
📜 SIMILAR VOLUMES
Ammon, K., An automatic proof of G~lel's incompleteness theorem (Research Note), Artificial Intelligence 61 (1993) 291-306. The SHUNYATA program contains heuristics which are related to reasoning processes of mathematicians and guide the search for a proof. For example, a heuristic applies the meth