𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Boolos-style proofs of limitative theorems

✍ Scribed by György Serény

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
126 KB
Volume
50
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Boolos's proof of incompleteness is extended straightforwardly to yield simple “diagonalization‐free” proofs of some classical limitative theorems of logic. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

📜 SIMILAR VOLUMES

A Note on Boolos' Proof of the Incomplet
A Note on Boolos' Proof of the Incompleteness Theorem
✍ Makoto Kikuchi 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 265 KB 👁 1 views

## 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.

Short proofs of classical theorems
Short proofs of classical theorems
✍ J. A. Bondy 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB

## Abstract We give proofs of Ore's theorem on Hamilton circuits, Brooks' theorem on vertex coloring, and Vizing's theorem on edge coloring, as well as the Chvátal‐Lovász theorem on semi‐kernels, a theorem of Lu on spanning arborescences of tournaments, and a theorem of Gutin on diameters of orient

Proof of the TCP Theorem
Proof of the TCP Theorem
✍ Gerhart Lüders 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 122 KB

A comparatively simple proof is given for the general theorem that a wide class of quantized field theories which are invariant under the proper Lorentz group is also invariant with respect to the product of time reversal (T), charge conjugation (C), and parity (P). In the proof use is made of an im

Short proofs for two theorems of Chien,
Short proofs for two theorems of Chien, Hell and Zhu
✍ Tracy Holt; Yared Nigussie 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

In (J Graph Theory 33 (2000) , 14-24), Hell and Zhu proved that if a series-parallel graph G has girth at least 2 (3k -1) / 2 , then c (G) ≤ 4k / (2k -1). In (J Graph Theory 33 (2000), [185][186][187][188][189][190][191][192][193][194][195][196][197][198], Chien and Zhu proved that the girth condit