159 research outputs found
A Generalization of Martin's Axiom
We define the chain condition. The corresponding forcing axiom
is a generalization of Martin's Axiom and implies certain uniform failures of
club--guessing on that don't seem to have been considered in the
literature before.Comment: 36 page
A new foundational crisis in mathematics, is it really happening?
The article reconsiders the position of the foundations of mathematics after
the discovery of HoTT. Discussion that this discovery has generated in the
community of mathematicians, philosophers and computer scientists might
indicate a new crisis in the foundation of mathematics. By examining the
mathematical facts behind HoTT and their relation with the existing
foundations, we conclude that the present crisis is not one. We reiterate a
pluralist vision of the foundations of mathematics. The article contains a
short survey of the mathematical and historical background needed to understand
the main tenets of the foundational issues.Comment: Final versio
Combinatorics of Open Covers VI: Selectors for Sequences of Dense Sets
We consider the following two selection principles for topological spaces:
[Principle 1:] { For each sequence of dense subsets, there is a sequence of points from the space, the n-th point coming from the n-th dense set, such that this set of points is dense in the space;
[Principle 2:]{ For each sequence of dense subsets, there is a sequence of finite sets, the n-th a subset of the n-th dense set, such that the union of these finite sets is dense in the space.
We show that for separable metric space X one of these principles holds for the space C_p(X) of realvalued continuous functions equipped with the pointwise convergence topology if, and only if, a corresponding principle holds for a special family of open covers of X. An example is given to show that these equivalences do not hold in general for Tychonoff spaces. It is further shown that these two principles give characterizations for two popular cardinal numbers, and that these two principles are intimately related to an infinite game that was studied by Berner and Juhasz
The combinatorics of the Baer-Specker group
Denote the integers by Z and the positive integers by N.
The groups Z^k (k a natural number) are discrete, and the classification up
to isomorphism of their (topological) subgroups is trivial. But already for the
countably infinite power Z^N of Z, the situation is different. Here the product
topology is nontrivial, and the subgroups of Z^N make a rich source of examples
of non-isomorphic topological groups. Z^N is the Baer-Specker group.
We study subgroups of the Baer-Specker group which possess group theoretic
properties analogous to properties introduced by Menger (1924), Hurewicz
(1925), Rothberger (1938), and Scheepers (1996). The studied properties were
introduced independently by Ko\v{c}inac and Okunev. We obtain purely
combinatorial characterizations of these properties, and combine them with
other techniques to solve several questions of Babinkostova, Ko\v{c}inac, and
Scheepers.Comment: To appear in IJ
Double Beta Decay: Historical Review of 75 Years of Research
Main achievements during 75 years of research on double beta decay have been
reviewed. The existing experimental data have been presented and the
capabilities of the next-generation detectors have been demonstrated.Comment: 25 pages, typos adde
- …