منابع مشابه
Boolos-style proofs of limitative theorems
In his famous paper announcing the incompleteness theorem, Gödel remarked that, though his argument is analogous to the Richard and the Liar paradoxes, “Any epistemological antinomy could be used for a similar proof of the existence of undecidable propositions.” ([7] Note 14). It is interesting that, despite the fact that the soundness of arguments like Gödel’s one built on self–reference (or d...
متن کاملReflexivity and the diagonal argument in proofs of limitative theorems
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. Gödel’s theorem on Entscheidungsproblem, Turing’s halting problem or Chaitin-Gödel’s theorem). The fact, that a formal system contains a sentence, which introduces reflexitivity, does not imply, that the same system does not contain a sentence or a proof procedure which solves t...
متن کاملOn Philosophical Sense of Metamathical Limitative Theorems
Logic was always considered as closely related to philosophy, even as an essential part of the latter. For example, Russell used to say that logic is the heart of philosophy. The connection of two fields can be illustrated by some views of Aristotle. According to the Stagirite the world consists of individual substances. Every substance has two elements, its matter and its form. Although the fo...
متن کاملAggregating subjective probabilities: some limitative theorems
1 Introduction Suppose that n individuals, labeled 1,..., n 9 wish to assign consensual probabilities to a sequence of events E u ..., E k which partition some set of possibilities. Let their subjective assignments be registered in an n x k matrix P = (Pij), where py denotes the subjective probability assigned by individual / to event Ej. The question of how to aggregate the probabilities in P ...
متن کاملShort proofs of classical theorems
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 orientations of graphs. These proofs, while not radically different from existing ones, are perhaps simpler and more...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MLQ
سال: 2004
ISSN: 0942-5616,1521-3870
DOI: 10.1002/malq.200310091