Real and imaginary classes in the alternative set theory
Let E₀ be the Vitali equivalence relation and E₃ the product of countably many copies of E₀. Two new dichotomy theorems for Borel equivalence relations are proved. First, for any Borel equivalence relation E that is (Borel) reducible to E₃, either E is reducible to E₀ or else E₃ is reducible to E. Second, if E is a Borel equivalence relation induced by a Borel action of a closed subgroup of the infinite symmetric group that admits an invariant metric, then either E is reducible to a countable...
We give a uniform proof that holds for every regular cardinal λ.
We deal with a conjectured dichotomy for compact Hausdorff spaces: each such space contains a non-trivial converging ω-sequence or a non-trivial converging ω₁-sequence. We establish that this dichotomy holds in a variety of models; these include the Cohen models, the random real models and any model obtained from a model of CH by an iteration of property K posets. In fact in these models every compact Hausdorff space without non-trivial converging ω₁-sequences is first-countable and, in addition,...
We prove that, e.g., if μ > cf(μ) = ℵ₀ and and every stationary family of countable subsets of μ⁺ reflects in some subset of μ⁺ of cardinality ℵ₁, then the SCH for μ⁺ holds (moreover, for μ⁺, any scale for μ⁺ has a bad stationary set of cofinality ℵ₁). This answers a question of Foreman and Todorčević who get such a conclusion from the simultaneous reflection of four stationary sets.
We improve some results of Pavlov and Filatova, concerning a problem of Malykhin, by showing that every regular space X that satisfies Δ(X) > e(X) is ω-resolvable. Here Δ(X), the dispersion character of X, is the smallest size of a non-empty open set in X, and e(X), the extent of X, is the supremum of the sizes of all closed-and-discrete subsets of X. In particular, regular Lindelöf spaces of uncountable dispersion character are ω-resolvable. We also prove that any regular...
The notion of a rough set, developed by Pawlak [10], is an important tool to describe situation of incomplete or partially unknown information. In this article, which is essentially the continuation of [6], we try to give the characterization of approximation operators in terms of ordinary properties of underlying relations (some of them, as serial and mediate relations, were not available in the Mizar Mathematical Library). Here we drop the classical equivalence- and tolerance-based models of rough...