𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Theorem on Shortening the Length of Proof in Formal Systems of Arithmetic

✍ Scribed by Robert A. Di Paola

Book ID
124972417
Publisher
Association for Symbolic Logic
Year
1975
Tongue
English
Weight
168 KB
Volume
40
Category
Article
ISSN
0022-4812

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Difficulty of Writing Out formal
On the Difficulty of Writing Out formal Proofs in Arithmetic
✍ Ryo Kashima; Takeshi Yamaguchi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

## Abstract Let ℸ be the set of Gödel numbers Gn(__f__) of function symbols __f__ such that PRA ⊢ and let γ be the function such that We prove: (1) The r. e. set ℸ is m‐complete; (2) the function γ is not primitive recursive in any class of functions {__f__~1~, __f__~2~, ⃛} so long as each __f~i~

A quintessential proof of van der Waerde
A quintessential proof of van der Waerden's theorem on arithmetic progressions
✍ George Mills 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 362 KB

A particularly well suited induction hypothesis is employed to give a short and relatively direct formulation of van der Waerden's argument which establishes that for any partition of the natural numbers into two classes, one of the classes contains arbitrarily long arithmetic progressions.