A Perfect Set of Reals with Finite Self-Information
نویسندگان
چکیده
منابع مشابه
Hurewicz Sets of Reals without Perfect Subsets
We show that even for subsetsX of the real line which do not contain perfect sets, the Hurewicz property does not imply the property S1(Γ,Γ), asserting that for each countable family of open γ-covers of X , there is a choice function whose image is a γcover of X . This settles a problem of Just, Miller, Scheepers, and Szeptycki. Our main result also answers a question of Bartoszyński and the se...
متن کاملDynamic Pricing with Periodic Review and a Finite set of Prices with Cancellation
In this paper, three dynamic pricing models are developed and analyzed. We assume a limited number of a particular asset is offered for sale over a period of time. This asset is perishable and can be an inventory or a manufacturing capacity. During each period, the seller sets a price for this asset. This price is selected from a predetermined discrete set. The maximum amount which a customer i...
متن کاملon finite a-perfect abelian groups
let $g$ be a group and $a=aut(g)$ be the group of automorphisms of $g$. then the element $[g,alpha]=g^{-1}alpha(g)$ is an autocommutator of $gin g$ and $alphain a$. also, the autocommutator subgroup of g is defined to be $k(g)=langle[g,alpha]|gin g, alphain arangle$, which is a characteristic subgroup of $g$ containing the derived subgroup $g'$ of $g$. a group is defined...
متن کاملFinite Self-Information
We present a definition, due to Levin, of mutual information I(A : B) for infinite sequences. We say that a set A has finite self-information if I(A : A) <∞. It is easy to see that every K-trivial set has finite self-information. We answer a question of Levin by showing that the converse does not hold. Finally, we investigate the connections between having finite self-information and other noti...
متن کاملSubgame Perfect Implementation With Almost Perfect Information
The theory of incomplete contracts has been recently questioned using or extending the subgame perfect implementation approach of Moore and Repullo (1988). We consider the robustness of this mechanism to the introduction of small amounts of asymmetric information. Our main result is that the mechanism may not yield (even approximately) truthful revelation as the amount of asymmetric information...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2013
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl.7804130