𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Critique and comment: Proof of a theorem on majority rule

✍ Scribed by Michael Taylor

Book ID
112014207
Publisher
John Wiley and Sons
Year
1969
Tongue
English
Weight
272 KB
Volume
14
Category
Article
ISSN
8756-6079

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A characterisation of some 2-connected g
A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
✍ Victor Bryant πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 196 KB

A simple characterisation of cycles and complete graphs highlights their significance in Brooks' theorem. It then shows that an algorithmic proof of that theorem. usually dealt with in two cases. is in fact covered by one of the cases. ## 1. Some 2-connected graphs Throughout this paper G = (V, E)

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

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.