نتایج جستجو برای: countable image
تعداد نتایج: 382693 فیلتر نتایج به سال:
Notes on set theory, mainly forcing. The first four sections closely follow the lecture notes Williams [8] and the book Kunen [4]. The last section covers topics from various sources, as indicated there. Hopefully, all errors are mine. 1. The Suslin problem 1.1. The Suslin hypothesis. Recall that R is the unique dense, complete and separable order without endpoints (up to isomorphism). It follo...
Denote by nA the sum of n copies of a Boolean algebra A. We prove that, for any countable Boolean algebra A, nA at mA with m > n implies nA a (n + \)A. In [2], W. Hanf constructed a Boolean algebra H isomorphic to the direct product H X H X H but not to H X H. This result of Hanf was strengthened by J. Ketonen in [4]: there exists even a countable Boolean algebra with this property. In [1], P. ...
in this paper, countable compactness and the lindel¨of propertyare defined for l-fuzzy sets, where l is a complete de morgan algebra. theydon’t rely on the structure of the basis lattice l and no distributivity is requiredin l. a fuzzy compact l-set is countably compact and has the lindel¨ofproperty. an l-set having the lindel¨of property is countably compact if andonly if it is fuzzy compact. ...
§0. Introduction. Few methods are known to construct non Lebesgue-measurable sets of reals: most standard ones start from a well-ordering of R, or from the existence of a non-trivial ultrafilter over ω, and thus need the axiom of choice AC or at least the Boolean Prime Ideal theorem BPI (see [5]). In this paper we present a new way for proving the existence of non-measurable sets using a conven...
Currently, the most popular views about how to update de se or self-locating beliefs entail the one-third solution to the Sleeping Beauty problem. 2 Another widely held view is that an agent‘s credences should be countably additive. 3 In what follows, I will argue that there is a deep tension between these two positions. For the assumptions that underlie the one-third solution to the Sleeping B...
THIS paper concerns maximal subgroups of symmetric groups on infinite, usually countable, sets. Our main aim is to give examples of maximal subgroups which could claim to be almost stabilisers of familiar combinatorial structures. We emphasise that maximal subgroup always means maximal proper subgroup. Throughout this paper, Cl will denote an infinite set, usually countable. The power set of Q ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید