default search action
David Asperó
Person information
- affiliation: University of East Anglia, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]David Asperó, Miguel Angel Mota:
Few new reals. J. Math. Log. 24(2): 2350009:1-2350009:35 (2024) - 2022
- [j21]David Asperó
, Matteo Viale:
Incompatible bounded category forcing axioms. J. Math. Log. 22(2): 2250006:1-2250006:76 (2022) - [j20]David Asperó
Retraction - Measuring Club-sequences Together with the continuum Large. J. Symb. Log. 87(2): 870 (2022) - 2021
- [j19]David Asperó
Dependent Choice, properness, and Generic Absoluteness. Rev. Symb. Log. 14(1): 225-249 (2021)
2010 – 2019
- 2019
- [j18]David Asperó
Reducibility of Equivalence Relations Arising from Nonstationary Ideals under Large Cardinal Assumptions. Notre Dame J. Formal Log. 60(4): 665-682 (2019) - 2018
- [j17]David Asperó, Konstantinos Tsaprounis:
Long reals. J. Log. Anal. 10 (2018) - [j16]David Asperó
A forcing Notion Collapsing $\aleph _3 $ and Preserving All other Cardinals. J. Symb. Log. 83(4): 1579-1594 (2018) - 2017
- [j15]David Asperó:
Adding many Baumgartner clubs. Arch. Math. Log. 56(7-8): 797-810 (2017) - 2016
- [j14]David Asperó, Miguel Angel Mota:
Separating club-guessing principles in the presence of fat forcing axioms. Ann. Pure Appl. Log. 167(3): 284-308 (2016) - 2015
- [j13]David Asperó, Peter Holy, Philipp Lücke
Forcing lightface definable well-orders without the GCH. Ann. Pure Appl. Log. 166(5): 553-582 (2015) - 2014
- [j12]David Asperó, Ralf Schindler:
Bounded Martin's Maximum with an Asterisk. Notre Dame J. Formal Log. 55(3): 333-348 (2014) - 2013
- [j11]David Asperó, Sy-David Friedman, Miguel Angel Mota, Marcin Sabok:
Baumgartner's conjecture and bounded forcing axioms. Ann. Pure Appl. Log. 164(12): 1178-1186 (2013) - 2012
- [j10]David Asperó, Sy-David Friedman:
Definable well-orders of H(ω2) and GCH. J. Symb. Log. 77(4): 1101-1121 (2012)
2000 – 2009
- 2009
- [j9]David Asperó:
Forcing notions in inner models. Arch. Math. Log. 48(7): 643-651 (2009) - [j8]David Asperó:
On a convenient property about [gamma]aleph0. Arch. Math. Log. 48(7): 653-677 (2009) - [j7]David Asperó, Sy D. Friedman:
Large cardinals and locally defined well-orders of the universe. Ann. Pure Appl. Log. 157(1): 1-15 (2009) - [j6]David Asperó, John Krueger, Yasuo Yoshinobu:
Dense non-reflection for stationary collections of countable sets. Ann. Pure Appl. Log. 161(1): 94-108 (2009) - 2007
- [j5]David Asperó:
Guessing and non-guessing of canonical functions. Ann. Pure Appl. Log. 146(2-3): 150-179 (2007) - 2006
- [j4]David Asperó:
Coding by club-sequences. Ann. Pure Appl. Log. 142(1-3): 98-114 (2006) - 2002
- [j3]David Asperó:
A Maximal Bounded Forcing Axiom. J. Symb. Log. 67(1): 130-142 (2002) - [j2]David Asperó, Philip D. Welch
Bounded Martin's Maximum, Weak Erdös Cardinals and psi AC. J. Symb. Log. 67(3): 1141-1152 (2002) - 2001
- [j1]David Asperó, Joan Bagaria
Bounded forcing axioms and the continuum. Ann. Pure Appl. Log. 109(3): 179-203 (2001)
Coauthor Index
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-09-10 23:44 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: