•  11
    Few new reals
    with Miguel Angel Mota
    Journal of Mathematical Logic. forthcoming.
    We introduce a new method for building models of [Formula: see text], together with [Formula: see text] statements over [Formula: see text], by forcing. Unlike other forcing constructions in the literature, our construction adds new reals, although only [Formula: see text]-many of them. Using this approach, we build a model in which a very strong form of the negation of Club Guessing at [Formula: see text] known as [Formula: see text] holds together with [Formula: see text], thereby answering a …Read more
  •  21
    Bounded forcing axioms and the continuum
    Annals of Pure and Applied Logic 109 (3): 179-203. 2001.
    We show that bounded forcing axioms are consistent with the existence of -gaps and thus do not imply the Open Coloring Axiom. They are also consistent with Jensen's combinatorial principles for L at the level ω2, and therefore with the existence of an ω2-Suslin tree. We also show that the axiom we call BMM3 implies 21=2, as well as a stationary reflection principle which has many of the consequences of Martin's Maximum for objects of size 2. Finally, we give an example of a so-called boldface bo…Read more
  •  15
    Incompatible bounded category forcing axioms
    with Matteo Viale
    Journal of Mathematical Logic 22 (2). 2022.
    Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We introduce bounded category forcing axioms for well-behaved classes [math]. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe [math] modulo forcing in [math], for some cardinal [math] naturally associated to [math]. These axioms naturally extend projective absoluteness for arbitrary set-forcing — in this situation [math] — to classes [math] with [math]. Unl…Read more
  •  15
    Retraction – measuring club-sequences together with the continuum large
    with Miguel Angel Mota
    Journal of Symbolic Logic 87 (2): 870-870. 2022.
  •  30
    Dependent choice, properness, and generic absoluteness
    with Asaf Karagila
    Review of Symbolic Logic 1-25. forthcoming.
    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 $\mathsf {DC}$ -preserving symmetric submodels of forcing extensions. Hence, $\mathsf {ZF}+\mathsf {DC}$ not only provides the right framework for developing classical analysis, but is also the right base theory over which to safeguard truth in analysis from the independ…Read more
  •  16
    Reducibility of Equivalence Relations Arising from Nonstationary Ideals under Large Cardinal Assumptions
    with Tapani Hyttinen, Vadim Kulikov, and Miguel Moreno
    Notre Dame Journal of Formal Logic 60 (4): 665-682. 2019.
    Working under large cardinal assumptions such as supercompactness, we study the Borel reducibility between equivalence relations modulo restrictions of the nonstationary ideal on some fixed cardinal κ. We show the consistency of Eλ-clubλ++,λ++, the relation of equivalence modulo the nonstationary ideal restricted to Sλλ++ in the space λ++, being continuously reducible to Eλ+-club2,λ++, the relation of equivalence modulo the nonstationary ideal restricted to Sλ+λ++ in the space 2λ++. Then we show…Read more
  •  12
    Measuring club-sequences together with the continuum large
    with Miguel Angel Mota
    Journal of Symbolic Logic 82 (3): 1066-1079. 2017.
    Measuring says that for every sequence ${\left_{\delta {\aleph _2}$. The construction works over any model of ZFC + CH and can be described as a finite support forcing iteration with systems of countable structures as side conditions and with symmetry constraints imposed on its initial segments. One interesting feature of this iteration is that it adds dominating functions $f:{\omega _1} \to {\omega _1}$ mod. countable at each stage.
  •  42
  •  17
    Adding many Baumgartner clubs
    Archive for Mathematical Logic 56 (7-8): 797-810. 2017.
    I define a homogeneous \–c.c. proper product forcing for adding many clubs of \ with finite conditions. I use this forcing to build models of \=\aleph _2\), together with \\) and \ large and with very strong failures of club guessing at \.
  •  24
    Separating club-guessing principles in the presence of fat forcing axioms
    with Miguel Angel Mota
    Annals of Pure and Applied Logic 167 (3): 284-308. 2016.
  •  432
    Definable well-orders of $H(\omega _2)$ and $GCH$
    Journal of Symbolic Logic 77 (4): 1101-1121. 2012.
    Assuming ${2^{{N_0}}}$ = N₁ and ${2^{{N_1}}}$ = N₂, we build a partial order that forces the existence of a well-order of H(ω₂) lightface definable over ⟨H(ω₂), Є⟩ and that preserves cardinal exponentiation and cofinalities.
  •  47
    Large cardinals and locally defined well-orders of the universe
    Annals of Pure and Applied Logic 157 (1): 1-15. 2009.
    By forcing over a model of with a class-sized partial order preserving this theory we produce a model in which there is a locally defined well-order of the universe; that is, one whose restriction to all levels H is a well-order of H definable over the structure H, by a parameter-free formula. Further, this forcing construction preserves all supercompact cardinals as well as all instances of regular local supercompactness. It is also possible to define variants of this construction which, in add…Read more
  •  21
    Bounded Martin’s Maximum with an Asterisk
    Notre Dame Journal of Formal Logic 55 (3): 333-348. 2014.
    We isolate natural strengthenings of Bounded Martin’s Maximum which we call ${\mathsf{BMM}}^{*}$ and $A-{\mathsf{BMM}}^{*,++}$, and we investigate their consequences. We also show that if $A-{\mathsf{BMM}}^{*,++}$ holds true for every set of reals $A$ in $L$, then Woodin’s axiom $$ holds true. We conjecture that ${\mathsf{MM}}^{++}$ implies $A-{\mathsf{BMM}}^{*,++}$ for every $A$ which is universally Baire
  •  3
    We present several forcing posets for adding a non-reflecting stationary subset of Pω1, where λ≥ω2. We prove that PFA is consistent with dense non-reflection in Pω1, which means that every stationary subset of Pω1 contains a stationary subset which does not reflect to any set of size 1. If λ is singular with countable cofinality, then dense non-reflection in Pω1 follows from the existence of squares
  •  31
    Forcing lightface definable well-orders without the GCH
    with Peter Holy and Philipp Lücke
    Annals of Pure and Applied Logic 166 (5): 553-582. 2015.
  •  41
    A maximal bounded forcing axiom
    Journal of Symbolic Logic 67 (1): 130-142. 2002.
    After presenting a general setting in which to look at forcing axioms, we give a hierarchy of generalized bounded forcing axioms that correspond level by level, in consistency strength, with the members of a natural hierarchy of large cardinals below a Mahlo. We give a general construction of models of generalized bounded forcing axioms. Then we consider the bounded forcing axiom for a class of partially ordered sets Γ 1 such that, letting Γ 0 be the class of all stationary-set-preserving partia…Read more
  •  18
    On a convenient property about $${[\gamma]^{\aleph_0}}$$
    Archive for Mathematical Logic 48 (7): 653-677. 2009.
    Several situations are presented in which there is an ordinal γ such that ${\{ X \in [\gamma]^{\aleph_0} : X \cap \omega_1 \in S\,{\rm and}\, ot(X) \in T \}}$ is a stationary subset of ${[\gamma]^{\aleph_0}}$ for all stationary ${S, T\subseteq \omega_1}$ . A natural strengthening of the existence of an ordinal γ for which the above conclusion holds lies, in terms of consistency strength, between the existence of the sharp of ${H_{\omega_2}}$ and the existence of sharps for all reals. Also, an op…Read more
  •  14
    Coding by club-sequences
    Annals of Pure and Applied Logic 142 (1): 98-114. 2006.
    Given any subset A of ω1 there is a proper partial order which forces that the predicate xA and the predicate xω1A can be expressed by -provably incompatible Σ3 formulas over the structure Hω2,,NSω1. Also, if there is an inaccessible cardinal, then there is a proper partial order which forces the existence of a well-order of Hω2 definable over Hω2,,NSω1 by a provably antisymmetric Σ3 formula with two free variables. The proofs of these results involve a technique for manipulating the guessing pr…Read more
  •  26
    Bounded Martin's Maximum, Weak [image] Cardinals, and [image]
    with Philip D. Welch
    Journal of Symbolic Logic 67 (3). 2002.
    We prove that a form of the $Erd\H{o}s$ property (consistent with $V = L\lbrack H_{\omega_2}\rbrack$ and strictly weaker than the Weak Chang's Conjecture at ω1), together with Bounded Martin's Maximum implies that Woodin's principle $\psi_{AC}$ holds, and therefore 2ℵ0 = ℵ2. We also prove that $\psi_{AC}$ implies that every function $f: \omega_1 \rightarrow \omega_1$ is bounded by some canonical function on a club and use this to produce a model of the Bounded Semiproper Forcing Axiom in which B…Read more
  •  27
    Forcing notions in inner models
    Archive for Mathematical Logic 48 (7): 643-651. 2009.
    There is a partial order ${\mathbb{P}}$ preserving stationary subsets of ω 1 and forcing that every partial order in the ground model V that collapses a sufficiently large ordinal to ω 1 over V also collapses ω 1 over ${V^{\mathbb{P}}}$ . The proof of this uses a coding of reals into ordinals by proper forcing discovered by Justin Moore and a symmetric extension of the universe in which the Axiom of Choice fails. Also, using one feature of the proof of the above result together with an argument …Read more
  • A Maximal Bounded Forcing Axiom
    Journal of Symbolic Logic 67 (1): 130-142. 2002.
  •  3
    Several situations are presented in which there is an ordinal γ such that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\{ X \in [\gamma]^{\aleph_0} : X \cap \omega_1 \in S\,{\rm and}\, ot(X) \in T \}}$$\end{document} is a stationary subset of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym}…Read more
  •  38
    Dense non-reflection for stationary collections of countable sets
    with John Krueger and Yasuo Yoshinobu
    Annals of Pure and Applied Logic 161 (1): 94-108. 2010.
  •  19
    Guessing and non-guessing of canonical functions
    Annals of Pure and Applied Logic 146 (2): 150-179. 2007.
    It is possible to control to a large extent, via semiproper forcing, the parameters measuring the guessing density of the members of any given antichain of stationary subsets of ω1 . Here, given a pair of ordinals, we will say that a stationary set Sω1 has guessing density if β0=γ and , where γ is, for every stationary S*ω1, the infimum of the set of ordinals τ≤ω1+1 for which there is a function with ot)
  •  26
    Baumgartnerʼs conjecture and bounded forcing axioms
    with Sy-David Friedman, Miguel Angel Mota, and Marcin Sabok
    Annals of Pure and Applied Logic 164 (12): 1178-1186. 2013.