EDBT 2026 Demo / reviewers in the wild / expert
John Krueger
dblp:14/3092
· DBLP profile ↗
19ranked-venue papers
13as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 19 · 13 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Suslin Tree Preservation and Club IsomorphismsabstractAbstract We construct a model of set theory in which there exists a Suslin tree and satisfies that any two normal Aronszajn trees, neither of which contains a Suslin subtree, are club isomorphic. We also show that if S is a free normal Suslin tree, then for any positive integer n there is a c.c.c. forcing extension in which S is n-free but all of its derived trees of dimension greater than n are special. John Krueger |
J. Symb. Log. | 1 |
| 2025 | A rigid Kurepa Tree from a Free Suslin TreeabstractAbstract We analyze a countable support product of a free Suslin tree which turns it into a highly rigid Kurepa tree with no Aronszajn subtree. In the process, we introduce a new rigidity property for trees, which says roughly speaking that any non-trivial strictly increasing function from a section of the tree into itself maps into a cofinal branch. John Krueger |
J. Symb. Log. | 1 |
| 2023 | A large pairwise far family of Aronszajn trees
John Krueger |
Ann. Pure Appl. Log. | 1 |
| 2020 | A forcing axiom for a non-special Aronszajn tree
John Krueger |
Ann. Pure Appl. Log. | 1 |
| 2019 | The approachability ideal without a maximal set
John Krueger |
Ann. Pure Appl. Log. | 1 |
| 2019 | The Harrington-Shelah Model with Large continuumabstractAbstract We prove from the existence of a Mahlo cardinal the consistency of the statement that 2 ω = ω 3 holds and every stationary subset of ${\omega _2}\mathop \cap \nolimits {\rm{cof}}\left( \omega \right)$ reflects to an ordinal less than ω 2 with cofinality ω 1 . Thomas Gilton, John Krueger |
J. Symb. Log. | 2 |
| 2018 | Club isomorphisms on higher Aronszajn trees
John Krueger |
Ann. Pure Appl. Log. | 1 |
| 2018 | Namba forcing, Weak Approximation, and GuessingabstractAbstract We prove a variation of Easton’s lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle IGMP, GMP together with 2ω ≤ ω2 is consistent with the existence of an ω1-distributive nowhere c.c.c. forcing poset of size ω1. We introduce the idea of a weakly guessing model, and prove that many of the strong consequences of the principle GMP follow from the existence of stationarily many weakly guessing models. Using Namba forcing, we construct a model in which there are stationarily many indestructibly weakly guessing models which have a bounded countable subset not covered by any countable set in the model. Sean Cox 0001, John Krueger |
J. Symb. Log. | 2 |
| 2017 | Mitchell's theorem revisited
Thomas Gilton, John Krueger |
Ann. Pure Appl. Log. | 2 |
| 2016 | Quotients of strongly Proper Forcings and Guessing ModelsabstractAbstract We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have universal strongly generic conditions on a stationary set of models by certain nice regular suborders satisfy the ω1-approximation property. We prove that the existence of stationarily many ω1-guessing models in Pω2(H(θ)), for sufficiently large cardinals θ, is consistent with the continuum being arbitrarily large, solving a problem of Viale and Weiss [13]. Sean Cox 0001, John Krueger |
J. Symb. Log. | 2 |
| 2014 | Separating weak partial square principles
John Krueger, Ernest Schimmerling |
Ann. Pure Appl. Log. | 1 |
| 2013 | Namba forcing and no good scaleabstractAbstract We develop a version of Namba forcing which is useful for constructing models with no good scale on ℵω. A model is produced in which holds for all finiten≥ 1, but there is no good scale on ℵω; this strengthens a theorem of Cummings, Foreman, and Magidor [3] on the non-compactness of square. John Krueger |
J. Symb. Log. | 1 |
| 2011 | Weak compactness and no partial squaresabstractAbstract We present a characterization of weakly compact cardinals in terms of generalized stationarity. We apply this characterization to construct a model with no partial square sequences. John Krueger |
J. Symb. Log. | 1 |
| 2009 | Dense non-reflection for stationary collections of countable sets
David Asperó, John Krueger, Yasuo Yoshinobu |
Ann. Pure Appl. Log. | 2 |
| 2009 | Some applications of mixed support iterations
John Krueger |
Ann. Pure Appl. Log. | 1 |
| 2009 | Approachability at the second successor of a singular cardinalabstractAbstract We prove that if μ is a regular cardinal and ℙ is a μ-centered forcing poset, then ℙ forces that (I[μ++[)V generates I[μ++] modulo clubs. Using this result, we construct models in which the approachability property fails at the successor of a singular cardinal. We also construct models in which the properties of being internally club and internally approachable are distinct for sets of size the successor of a singular cardinal. Moti Gitik, John Krueger |
J. Symb. Log. | 2 |
| 2006 | Adding clubs with square
John Krueger |
Ann. Pure Appl. Log. | 1 |
| 2005 | Strong compactness and stationary setsabstractAbstract We construct a model in which there is a strongly compact cardinal κ such thai the set S(κ, κ+) ={ a Є Pκκ+: o.t.(a) = (a⋂ κ)+}is non-stationary. John Krueger |
J. Symb. Log. | 1 |
| 2003 | Fat sets and saturated idealsabstractAbstract We strengthen a theorem of Gitik and Shelah [6] by showing that if κ is either weakly inaccessible or the successor of a singular cardinal andSis a stationary subset of κ such thatNSκ↾Sis saturated then κ ∖Sis fat. Using this theorem we derive some results about the existence of fat stationary sets. We then strengthen some results due to Baumgartner and Taylor [2], showing in particular that ifIis aλ+++-saturated normal ideal onPκλthen the conditions of beingλ+-preserving, weakly presaturated, and presaturated are equivalent forI. John Krueger |
J. Symb. Log. | 1 |