Related papers: A Sacks Real out of Nowhere
Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…
Let $\omega=[a_1, a_2, \cdots]$ be the infinite expansion of continued fraction for an irrational number $\omega \in (0,1)$; let $R_n (\omega)$ (resp. $R_{n, \, k} (\omega)$, $R_{n, \, k+} (\omega)$) be the number of distinct partial…
We give examples of real Banach spaces with exactly infinite countably many complex structures and with $\omega_1$ many complex structures.
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a {\em stochastic maximal inequality} derived by using the formula for…
Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…
In this short note we observe that the higher topological complexity of an iterated connected sum of real projective spaces is maximal possible. Unlike the case of regular TC, the result is accessible through easy mod 2 zero-divisor…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…
Finite automata on infinite words ($\omega$-automata) proved to be a powerful weapon for modeling and reasoning infinite behaviors of reactive systems. Complementation of $\omega$-automata is crucial in many of these applications. But the…
The voting process is formalized as a multistage voting model with successive alternative elimination. A finite number of agents vote for one of the alternatives each round subject to their preferences. If the number of votes given to the…
Given $s\in (3/2,2)$ and $\varepsilon >0$, we construct a compactly supported initial data $\theta_0$ such that $\| \theta_0 \|_{H^s}\leq \varepsilon$ and there exist $T>0$, $c>0$ and a local-in-time solution $\theta$ of the SQG equation…
We introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.
We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…
The aim of this note is to investigate the open-open game of uncountable length. We introduce a cardinal number $\mu(X)$, which says how long the Player I has to play to ensure a victory. It is proved that $\su(X)\leq\mu(X)\leq\su(X)^+$. We…
We prove existence and multiplicity results for finite energy solutions to the nonlinear elliptic equation \[ -\triangle u+V\left( \left| x\right| \right) u=g\left( \left| x\right| ,u\right) \quad \textrm{in }\Omega \subseteq…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
We present several $\mathsf{ZFC}$ examples of compactifications $\gamma\omega$ of $\omega$ such that their remainders $\gamma\omega\backslash\omega$ are nonseparable and carry strictly positive measures.
We construct an indecomposable continuum with exactly one strong non-cut point. The method is an adaptation of Bellamy $[1]$. We start with an $\omega_1$-chain of indecomposable metric continua and retractions. The inverse limit is an…
We construct an injection from the set of permutations of length $n$ that contain exactly one copy of the decreasing pattern of length $k$ to the set of permutations of length $n+2$ that avoid that pattern. We then prove that the generating…