Searcharxiv⌕ Search

arXiv subjects

Jindřich Zapletal

Publications and source records attributed to Jindřich Zapletal.

10 recordsLinked to original sources

Why Y-c.c

We outline a portfolio of novel iterable properties of c.c.c. and proper forcing notions and study its most important instantiations, Y-c.c. and Y-properness. These properties have interesting consequences for partition-type forcings and anticliques in open graphs. Using Neeman's side condition method it is possible to obtain PFA variations and prove consistency results for them.

math.LO↗

Canonical models for aleph_1 combinatorics

We define the property of Pi_2-compactness of a statement phi of set theory, meaning roughly that the hard core of the impact of phi on combinatorics of aleph_1 can be isolated in a canonical model for the statement phi. We show that the following statements are Pi_2-compact: ``dominating number = aleph_1,'' ``cofinality of the meager ideal = aleph_1'', ``cofinality of the null ideal = aleph_1'', existence of various types of Souslin trees and variations on uniformity of measure and category = aleph_1. Several important new metamathematical patterns among classical statements of set theory are pointed out.

math.LO↗

Semi-Cohen Boolean algebras

We investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A >>Cohen algebra<< is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of Cohen algebras: semi-Cohen algebras, pseudo-Cohen algebras and potentially Cohen algebras. These classes of Boolean algebras are closed under completion.

math.LO↗

Embeddings of Cohen algebras

Complete Boolean algebras proved to be an important tool in topology and set theory. Two of the most prominent examples are B(kappa), the algebra of Borel sets modulo measure zero ideal in the generalized Cantor space {0,1}^kappa equipped with product measure, and C(kappa), the algebra of regular open sets in the space {0,1}^kappa, for kappa an infinite cardinal. C(kappa) is much easier to analyse than B(kappa) : C(kappa) has a dense subset of size kappa, while the density of B(kappa) depends on the cardinal characteristics of the real line; and the definition of C(kappa) is simpler. Indeed, C(kappa) seems to have the simplest definition among all algebras of its size. In the Main Theorem of this paper we show that in a certain precise sense, C(aleph_1) has the simplest structure among all algebras of its size, too. MAIN THEOREM: If ZFC is consistent then so is ZFC + 2^{aleph_0}= aleph_2 +``for every complete Boolean algebra B of uniform density aleph_1, C(aleph_1) is isomorphic to a complete subalgebra of B''.

math.LO↗

Semi-Cohen Versus Cohen Algebras

We show that there are semi-Cohen Boolean algebras which cannot be completely embedded into Cohen Boolean algebras. Using the ideas from this proof, we give a simpler argument for a theorem of S. Koppelberg and S. Shelah, stating that there are complete subalgebras of Cohen algebras which are not Cohen themselves.

math.LO↗

Shooting a club with finite conditions

We study cohabitation of the poset $P_S$ shooting a club through a given stationary subset $S$ of $ω_1$ with finite conditions with other forcings. Sample results: (1) $P_S$ "sometimes" preserves presaturatedness of $NS_{ω_1}$ (2) $P_S=P_T$ if $S=T mod NS_{ω_1}$ (in Boolean algebra sense) (3) Cons ( one can embed $Q,$ the poset adding $\aleph _1$ Cohen reals, to $P_S$ such that reals in $V^Q$ are the same as reals in $V^{P_S}.$ )

math.LO↗

More on the cut and choose game

We improve some ancient results of Velickovic on the cut and choose (c&c) game on complete Boolean algebras. (1) If Nonempty has a winning strategy for c&c game on $B$ then $B$ is semiproper. (2) If Nonempty has a winning strategy and $B$ has $2^{\aleph _0}$ -c.c. then Nonempty has a winning strategy in the descending chain game. (3) Cons ($B$ is $\aleph _1$-distributive implies Nonempty has a winning strategy in c&c on $B$ ) We also give some new examples of forcings where Nonempty has or does not have a winning strategy in c&c game.

math.LO↗

Splitting number and the core model

We can generalize the definition of {\it splitting number } $s(κ)$ for $κ$ uncountable regular: $s(κ)=min\{ |\Cal S|:\Cal S\subset \Cal P(κ) \forall a\in κ^κ\exists b\in \Cal S |a\cap b|=|a\setminus b|=κ\}$ However,$\exists κ>\aleph_0$ $s(κ)>κ^+$ becomes a considerable hypothesis,shown consistent from a supercompact.We show that it implies inner models of $\exists α:o(α)=α^{++}$

math.LO↗