default search action
John Krueger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j26]John Krueger:
A large pairwise far family of Aronszajn trees. Ann. Pure Appl. Log. 174(4): 103236 (2023) - 2020
- [j25]John Krueger:
A forcing axiom for a non-special Aronszajn tree. Ann. Pure Appl. Log. 171(8): 102820 (2020)
2010 – 2019
- 2019
- [j24]John Krueger:
The approachability ideal without a maximal set. Ann. Pure Appl. Log. 170(3): 297-382 (2019) - [j23]Thomas Gilton, John Krueger:
The Harrington-Shelah Model with Large continuum. J. Symb. Log. 84(2): 684-703 (2019) - 2018
- [j22]John Krueger:
Club isomorphisms on higher Aronszajn trees. Ann. Pure Appl. Log. 169(10): 1044-1081 (2018) - [j21]Sean Cox, John Krueger:
Namba forcing, Weak Approximation, and Guessing. J. Symb. Log. 83(4): 1539-1565 (2018) - 2017
- [j20]Thomas Gilton, John Krueger:
Mitchell's theorem revisited. Ann. Pure Appl. Log. 168(5): 922-1016 (2017) - [j19]John Krueger:
Forcing with adequate sets of models as side conditions. Math. Log. Q. 63(1-2): 124-149 (2017) - 2016
- [j18]Sean Cox, John Krueger:
Quotients of strongly Proper Forcings and Guessing Models. J. Symb. Log. 81(1): 264-283 (2016) - 2015
- [j17]John Krueger:
Adding a club with finite conditions, Part II. Arch. Math. Log. 54(1-2): 161-172 (2015) - [j16]John Krueger, Miguel Angel Mota:
Coherent adequate forcing and preserving CH. J. Math. Log. 15(2): 1550005:1-1550005:34 (2015) - 2014
- [j15]John Krueger:
Successive cardinals with no partial square. Arch. Math. Log. 53(1-2): 11-21 (2014) - [j14]John Krueger:
Strongly adequate sets and adding a club with finite conditions. Arch. Math. Log. 53(1-2): 119-136 (2014) - [j13]John Krueger, Ernest Schimmerling
:
Separating weak partial square principles. Ann. Pure Appl. Log. 165(2): 609-619 (2014) - 2013
- [j12]John Krueger:
Namba forcing and no good scale. J. Symb. Log. 78(3): 785-802 (2013) - 2011
- [j11]John Krueger, Ernest Schimmerling
An equiconsistency Result on Partial squares. J. Math. Log. 11(1) (2011) - [j10]John Krueger:
Weak compactness and no partial squares. J. Symb. Log. 76(3): 1035-1060 (2011)
2000 – 2009
- 2009
- [j9]John Krueger:
Some applications of mixed support iterations. Ann. Pure Appl. Log. 158(1-2): 40-57 (2009) - [j8]David Asperó, John Krueger, Yasuo Yoshinobu:
Dense non-reflection for stationary collections of countable sets. Ann. Pure Appl. Log. 161(1): 94-108 (2009) - [j7]Moti Gitik, John Krueger:
Approachability at the second successor of a singular cardinal. J. Symb. Log. 74(4): 1211-1224 (2009) - 2008
- [j6]John Krueger:
Internal Approachability and Reflection. J. Math. Log. 8(1) (2008) - [j5]John Krueger:
A general Mitchell style iteration. Math. Log. Q. 54(6): 641-651 (2008) - 2007
- [j4]John Krueger:
Radin forcing and its iterations. Arch. Math. Log. 46(3-4): 223-252 (2007) - 2006
- [j3]John Krueger:
Adding clubs with square. Ann. Pure Appl. Log. 141(1-2): 1-28 (2006) - 2005
- [j2]John Krueger:
Strong compactness and stationary sets. J. Symb. Log. 70(3): 767-777 (2005) - 2003
- [j1]John Krueger:
Fat sets and saturated ideals. J. Symb. Log. 68(3): 837-845 (2003)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: