Related papers: On a strengthening of J\'onssonness for $\aleph_\o…
Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…
We prove that it is consistent that $\aleph_\omega$ is strong limit, $2^{\aleph_\omega}$ is large and the universality number for graphs on $\aleph_{\omega+1}$ is small. The proof uses Prikry forcing with interleaved collapsing.
We give a simple proof of the increasing strengthening of Arhangel'skii's Theorem. Our proof naturally leads to a refinement of this result of Juh\'asz.
In a self-contained way, we deal with revised countable support iterated forcing for the reals. We improve theorems on preservation of the property UP, weaker than semi proper, and we hopefully improve the presentation. We continue [Sh:b,…
Recently, the first two authors proved the Alon-Jaeger-Tarsi conjecture on non-vanishing linear maps, for large primes. We extend their ideas to address several other related conjectures. We prove the weak Additive Basis conjecture proposed…
We present a model where \omega_1 is inaccessible by reals, Silver measurability holds for all sets but Miller and Lebesgue measurability fail for some sets. This contributes to a line of research started by Shelah in the 1980s and more…
A folk theorem says higher order arithmetic has the proof theoretic strength of set theory with limited power set. This paper makes the theorem precise in terms of several axiom system based on ZF.
Evidence in probabilistic reasoning may be 'hard' or 'soft', that is, it may be of yes/no form, or it may involve a strength of belief, in the unit interval [0, 1]. Reasoning with soft, [0, 1]-valued evidence is important in many situations…
In logical reasoning, it is often the case that only some of a collection of assumptions are needed to reach a conclusion. A strengthening lemma is an assertion that a given conclusion is independent in this sense of a particular…
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
We say that a ring is strongly (resp. weakly) left Jacobson if every semiprime (resp. prime) left ideal is an intersection of maximal left ideals. There exist Jacobson rings that are not weakly left Jacobson, e.g. the Weyl algebra. Our main…
We construct a model in which the tree property holds in $\aleph_{\omega + 1}$ and it is destructible under $\text{Col}(\omega, \omega_1)$. On the other hand we discuss some cases in which the tree property is indestructible under small or…
In the paper we introduce a weak set theory $\mathsf{H}_{<\omega}$ . A formalization of arithmetic on finite von Neumann ordinals gives an embedding of arithmetical language into this theory. We show that $\mathsf{H}_{<\omega}$ proves a…
In the lecture notes it is shown that an ordinal $\psi_{\Omega}(\varepsilon_{\mathbb{S}^{+}+1})$ is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\omega+(M\prec_{\Sigma_{1}}V)$. In this note we show that ${\sf…
We define and investigate versions of Silver and Mathias forcing with respect to lower and upper density. We focus on properness, Axiom A, chain conditions, preservation of cardinals and adding Cohen reals. We find rough forcings that…
We give a new proof of the fundamental theorem of algebra. It is entirely elementary, focused on using long division to its fullest extent. Further, the method quickly recovers a more general version of the theorem recently obtained by…
It is well known that the strong subadditivity theorem is hold for classical system, but it is very difficult to prove that it is hold for quantum system. The first proof of this theorem is due to Lieb by using the Lieb's theorem. Here we…
We prove that if there is a dominating family of size ${\aleph}_{1}$, then there is are ${\aleph}_{1}$ many compact subsets of ${\omega}^{\omega}$ whose union is a maximal almost disjoint family of functions that is also maximal with…
We prove the consistency result from the title. By forcing we construct a model of g=aleph_1, b=cf(Sym(omega))=aleph_2.
In this note we deduce a strengthening of the Orlicz-Pettis theorem from the It\^o-Nisio theorem. The argument shows that given any series in a Banach space which isn't summable (or more generally unconditionally summable), we can construct…