Related papers: On fresh sets in iterations of Prikry type forcing…
In this paper we invastigate the notion of generalized (I,J) - Luzin set. This notion generalize the standard notion of Luzin set and Sierpinski set. We find set theoretical conditions which imply the existence of generalized (I,J) - Luzin…
We prove an iteration theorem which guarantees for a wide class of nice iterations of $\omega_1$-preserving forcings that $\omega_1$ is not collapse, at the price of needing large cardinals to burn as fuel. More precisely, we show that a…
I isolate a combinatorial property of a poset $\mathbb{P}$ that I call the strong Prikry property, which implies the existence of an ultrafilter on the complete Boolean algebra $\mathbb{B}$ of $\mathbb{P}$ such that one inclusion of the…
We present a modification to the Prikry on Extenders forcing notion allowing the blow up of the power set of a large cardinal, change its cofinality to omega without adding bounded subsets, working directly from arbitrary extender (e.g.,…
This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…
These are lecture notes from a course I gave at the University of Wisconsin during the Spring semester of 1993. Part 1 is concerned with Borel hierarchies. Section 13 contains an unpublished theorem of Fremlin concerning Borel hierarchies…
We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point…
We present sufficient conditions for the existence of forced oscillations in non-autonomous mechanical systems. Previously, similar results were obtained for systems with friction. Presented results hold both for systems with and without…
A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated to arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the…
Characterizing existence or not of periodic orbit is a classical problem and it has both theoretical importance and many real applications. Here, several new criterions on nonexistence of periodic orbits of the planar dynamical system $\dot…
We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…
We investigate the norms appearing in the forcing from combinatorial point of view. We make first steps towards building a catalog of the norms appearing in multiple settings and sources, reviewing four norms from Bartoszy\'nski and Judah…
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,…
We prove that various classical tree forcings -- for instance Sacks forcing, Mathias forcing, Laver forcing, Miller forcing and Silver forcing -- preserve the statement that every real has a sharp and hence analytic determinacy. We then…
We study semi-dynamical systems associated to delay differential equations. We give a simple criteria to obtain weak and strong persistence and provide sufficient conditions to guarantee uniform persistence. Moreover, we show the existence…
We define the Pythagorean fuzzy parameterized soft set and investigate some properties of the new set. Further, we propose to the solution of decision-making application for the Pythagorean fuzzy parameterized soft set and other related…
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…
The foundations of forcing theory are reworked to streamline the presentation and to show how the most basic results are applicable in very general contexts.