Related papers: The subcompleteness of diagonal Prikry forcing
This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cicho\'n diagram. First I…
The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two…
We study the general problem of the behaviour of the continuum function in the presence of non-supercompact strongly compact cardinals.
In this paper, we show that the existence of certain first-countable compact-like extensions is equivalent to the equality between corresponding cardinal characteristics of the continuum. For instance, $\mathfrak b=\mathfrak s=\mathfrak c$…
We provide a model where u(\kappa) < 2^{\kappa} for a supercompact cardinal \kappa. Garti and Shelah have provided a sketch of how to obtain such a model by modifying the construction in a paper of Dzamonja and Shelah; we provide here a…
If T has only countably many complete types, yet has a type of infinite multiplicity then there is a ccc forcing notion Q such that, in any Q --generic extension of the universe, there are non-isomorphic models M_1 and M_2 of T that can be…
We prove from suitable large cardinal hypotheses that the least weakly compact cardinal can be unfoldable, weakly measurable and even nearly $\theta$-supercompact, for any desired $\theta$. In addition, we prove several global results…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…
Index tracking is a popular passive investment strategy aimed at optimizing portfolios, but fully replicating an index can lead to high transaction costs. To address this, partial replication have been proposed. However, the cardinality…
We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…
Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…
Using a countable support product of creature forcing posets, we show that consistently, for uncountably many different functions the associated Yorioka ideals' uniformity numbers can be pairwise different. In addition we show that, in the…
We study the average simplex cardinality Dim^+(G) = sum_x |x|/(|G|+1) of a finite abstract simplicial complex G. The functional is a homomorphism from the monoid of simplicial complexes to the rationals: the formula Dim^+(G + H) = Dim^+(G)…
Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…
Despite being an established notion in the large cardinal hierarchy, results about Woodin cardinals are sparse in the literature. Here we gather known results about the preservation of Woodin cardinals under certain forcing extensions, as…
We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…
We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
Based on works of Saharon Shelah, Jakob Kellner, and Anda T\u{a}nasie for controlling the cardinal characteristics of the continuum in ccc forcing extensions, in the author's master's thesis was introduced a new combinatorial notion: the…
We study the Mathias--Prikry and the Laver type forcings associated with filters and coideals. We isolate a crucial combinatorial property of Mathias reals, and prove that Mathias--Prikry forcings with summable ideals are all mutually…