منابع مشابه
A Simpler proof of Jensen's Coding Theorem
[82] provides a proof of Jensen's remarkable Coding Theorem , which demonstrates that the universe can be included in L[R] for some real R, via class forcing. The purpose of this article is to present a simpler proof of Jensen's theorem, obtained by implementing some changes first developed for the theory of strong coding (Friedman [87]). The basic idea is to first choose A ⊆ ORD so that V = L[...
متن کاملA simpler derivation of the coding theorem
A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many preliminaries and the information density and mutual information follow naturally in the proof. It may also be applicable to situations where typicality is not natural.
متن کامل2 4 N ov 1 99 2 A Simpler Proof of Jensen ’ s Coding Theorem
[82] provides a proof of Jensen's remarkable Coding Theorem , which demonstrates that the universe can be included in L[R] for some real R, via class forcing. The purpose of this article is to present a simpler proof of Jensen's theorem, obtained by implementing some changes first developed for the theory of strong coding (Friedman [87]). The basic idea is to first choose A ⊆ ORD so that V = L[...
متن کاملHarsanyi’s Utilitarian Theorem: A Simpler Proof and Some Ethical Connotations
Harsanyi’s utilitarian theorem states that the social welfare function is the weighted sum of individuals’ utility functions if: (i) society maximizes expected social welfare; (ii) individuals maximize expected utility; (iii) society is indifferent between two probability distributions over social states whenever all individuals are. After giving a simpler proof, an alternative axiomatic founda...
متن کاملA simpler proof for the two disjoint odd cycles theorem
We give a short proof of the two disjoint odd cycles theorem which characterizes graphs without two vertex-disjoint odd cycles. Our proof does not depend on any matroid result. It only uses the two paths theorem, which characterizes graphs without two disjoint paths with specified ends (i.e, 2-linked graphs).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1994
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)90067-1