Related papers: Selection principles and proofs from the Book
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
We introduce the category of optiongraphs and option-preserving maps as a model to study impartial combinatorial games. Outcomes, remoteness, and extended nim-values are preserved under option-preserving maps. We show that the four…
In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of…
Several topological and analytical notions of continuity and fading memory for causal and time-invariant filters are introduced, and the relations between them are analyzed. A significant generalization of the convolution theorem that…
In this paper we show that forcings which are strongly proper for stationarily many countable elementary submodels preserve each of the following properties of topological spaces: countably tight; Lindel\"of; Rothberger; Menger; and a…
In this paper, we introduce the notions of Star-$\sigma\mathcal{K}$ and absolutely Star-$\sigma\mathcal{K}$ spaces which allow us to unify results among several properties in the theory of star selection principles on small spaces. In…
We apply to operator algebra theory a monotone selection principle which apparently escaped attention (of operator algebra theorists) so far. This principle relates to the basic order theoretic characterisation of von Neumann algebras given…
In this paper, we investigate what selection principles properties are possessed by small (with respect to the bounding and dominating numbers) unions of spaces with certain (star) selection principles.. Furthermore, we give several results…
The following selection theorem is established:\\ Let $X$ be a compactum possessing a binary normal subbase $\mathcal S$ for its closed subsets. Then every set-valued $\mathcal S$-continuous map $\Phi\colon Z\to X$ with closed $\mathcal…
We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…
The theorem we prove is a slight strengthening of some results by Just, Miller, Scheepers and Szeptycki [JMSS]. We use the Michael technique instead of the combinatorial approach in the literature. Comments by the submitter: This short…
In 1975 Szemer\'edi proved the long-standing conjecture of Erd\H{o}s and Tur\'an that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemer\'edi's proof was entirely…
We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…
A very simple but useful almost sure convergence theorem of probability is given.
In this paper we prove finiteness principles for $C^{m}\left( \mathbb{R}^{n}, \mathbb{R}^{D}\right) $-selection, and for $C^{m-1,1}\left( \mathbb{R}^{n}, \mathbb{R}^{D}\right) $-selection, in particular providing a proof for a conjecture of…
Let $\mathbf{M}$ be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, $\Delta_0$-separation and set foundation. This paper studies the relative strength of…
Krieger's embedding theorem provides necessary and sufficient conditions for an arbitrary subshift to embed in a given topologically mixing $\mathbb{Z}$-subshift of finite type. For some $\mathbb{Z}^d$-subshifts of finite type, Lightwood…
Two fundamental axioms in social choice theory are consistency with respect to a variable electorate and consistency with respect to components of similar alternatives. In the context of traditional non-probabilistic social choice, these…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
In this paper, we describe the formalization of the axiom of choice and several of its famous equivalent theorems in Morse-Kelley set theory. These theorems include Tukey's lemma, the Hausdorff maximal principle, the maximal principle,…