✦ LIBER ✦

A Note on Boolos' Proof of the Incompleteness Theorem

✍ Scribed by Makoto Kikuchi

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 265 KB
Volume: 40
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19940400409

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We give a proof of Gödel's first incompleteness theorem based on Berry's paradox, and from it we also derive the second incompleteness theorem model‐theoretically.

Mathematics Subject Classification: 03F30.

📜 SIMILAR VOLUMES

A note on the first incompleteness theor

A note on the first incompleteness theorem

✍ Katsumasa Ishii 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB 👁 1 views

## Abstract Let __T__ be an extension of Robinson's arithmetic Q. Then __T__ is incomplete even if the set of the Gödel numbers of all axioms of __T__ is ∑~2~.

A note on the compactness theorem

✍ R. R. Rockingham Gill 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

Z t i b r h r . /. math. h p i k und G'rutdlagtn d . . M a . l i d . ZI, s. 3 7 7 -378 (1975) A NOTE Oh' THE COMPACTNESS THEOREM by R. R. ROCKINGHAM GILL in Lampeter, Wales (Great Britain) # 3. In conclusion, let us remark that, if wc read " a filtcbr" for " a n ultrafilter" and "HORN sentence" for

A Proof of the Compactness Theorem

✍ Kenneth J. Danhof 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB 👁 1 views

Note on a Theorem of A. Ostrowski

✍ Richard J. Painter 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 1 views

A Note on the Carleson-Hunt Theorem

✍ M. Trinidad Menárguez 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 1 views

## Abstract We present a characterization of the almost everywhere convergence of the partial Fourier series of functions in __L__^p^(T), 1 < p < ∞, in terms of a discrete weak‐type inequality.

A short proof of a theorem on Hamiltonia

A short proof of a theorem on Hamiltonian graphs

✍ Ainouche, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John