default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul B. Larson
Person information
- affiliation: Miami University, Department of Mathematics, Oxford, OH, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j27]Konstantinos A. Beros
, Paul B. Larson:
Maximal Tukey types, P-ideals and the weak Rudin-Keisler order. Arch. Math. Log. 63(3-4): 325-352 (2024)- 2021
- [j26]Will Brian, Paul B. Larson:
Choosing between incompatible ideals. Eur. J. Comb. 96: 103349 (2021) - 2018
- [j25]Paul B. Larson, Saharon Shelah:
A model of $$\mathsf {ZFA}+ \mathsf {PAC}$$ ZFA + PAC with no outer model of $$\mathsf {ZFAC}$$ ZFAC with the same pure part. Arch. Math. Log. 57(7-8): 853-859 (2018) - 2017
- [j24]Paul B. Larson, Jindrich Zapletal:
Canonical Models for Fragments of the Axiom of Choice. J. Symb. Log. 82(2): 489-509 (2017) - [j23]Paul B. Larson, Saharon Shelah:
Coding with canonical functions. Math. Log. Q. 63(5): 334-341 (2017) - 2016
- [j22]John T. Baldwin, Paul B. Larson:
Iterated elementary embeddings and the model theory of infinitary logic. Ann. Pure Appl. Log. 167(3): 309-334 (2016) - 2015
- [j21]John T. Baldwin, Paul B. Larson, Saharon Shelah:
Almost Galois ω-Stable Classes. J. Symb. Log. 80(3): 763-784 (2015) - 2012
- [j20]Paul B. Larson, Nicholas Matteo, Saharon Shelah:
Majority decisions when abstention is possible. Discret. Math. 312(7): 1336-1352 (2012) - [j19]Tetsuya Ishiu, Paul B. Larson:
Some results about (+) proved by iterated forcing. J. Symb. Log. 77(2): 515-531 (2012) - [j18]Tetsuya Ishiu, Paul B. Larson:
ℛmax variations for separating club guessing principles. J. Symb. Log. 77(2): 532-544 (2012) - 2010
- [j17]Richard Ketchersid, Paul B. Larson, Jindrich Zapletal:
Regular embeddings of the stationary tower and Woodin's Sigma22 maximality theorem. J. Symb. Log. 75(2): 711-727 (2010) - 2009
- [j16]Paul B. Larson:
The filter Dichotomy and Medial Limits. J. Math. Log. 9(2) (2009) - [j15]Paul B. Larson, Saharon Shelah:
Splitting stationary sets from weak forms of Choice. Math. Log. Q. 55(3): 299-306 (2009) - 2008
- [j14]Paul B. Larson:
Martin's Maximum and definability in H(xaleph2). Ann. Pure Appl. Log. 156(1): 110-122 (2008) - [j13]Paul B. Larson, Saharon Shelah:
The stationary set splitting game. Math. Log. Q. 54(2): 187-193 (2008) - 2007
- [j12]Lúcia R. Junqueira, Paul B. Larson, Marcelo D. Passos:
On Extensions of Elementary Submodels by Forcing. Log. J. IGPL 15(5-6): 637-651 (2007) - [j11]Paul B. Larson:
The nonstationary ideal in the ℛmax extension. J. Symb. Log. 72(1): 138-158 (2007) - [j10]Richard Ketchersid, Paul B. Larson, Jindrich Zapletal:
Increasing δ12 and Namba-style forcing. J. Symb. Log. 72(4): 1372-1378 (2007) - 2006
- [j9]Lúcia R. Junqueira, Paul B. Larson, Franklin D. Tall:
Compact spaces, elementary submodels, and the countable chain condition. Ann. Pure Appl. Log. 144(1-3): 107-116 (2006) - 2005
- [j8]Paul B. Larson:
Saturation, Suslin trees and meager sets. Arch. Math. Log. 44(5): 581-595 (2005) - [j7]Paul B. Larson:
The canonical function game. Arch. Math. Log. 44(7): 817-827 (2005) - 2003
- [j6]Paul B. Larson, Saharon Shelah:
Bounding by Canonical Functions, with CH. J. Math. Log. 3(2) (2003) - 2002
- [j5]Paul B. Larson:
A Uniqueness Theorem for Iterations. J. Symb. Log. 67(4): 1344-1350 (2002) - 2000
- [j4]Paul B. Larson:
The size of [(T)\tilde]\tilde{T}. Arch. Math. Log. 39(7): 541-568 (2000) - [j3]Paul B. Larson:
Martin's Maximum and the Pmaxaxiom(*). Ann. Pure Appl. Log. 106(1-3): 135-149 (2000) - [j2]Paul B. Larson:
Separating Stationary Reflection Principles. J. Symb. Log. 65(1): 247-258 (2000) - 1999
- [j1]Paul B. Larson:
An Smax Variation for One Souslin Tree. J. Symb. Log. 64(1): 81-98 (1999)
Reference Works
- 2012
- [r1]Paul B. Larson:
A Brief History of Determinacy. Sets and Extensions in the Twentieth Century 2012: 457-507
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-05-06 21:15 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:
