Paul B. Larson

According to our database, Paul B. Larson authored at least 28 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Maximal Tukey types, P-ideals and the weak Rudin-Keisler order.

Konstantinos A. Beros, Paul B. Larson

Arch. Math. Log., May, 2024

2021

Choosing between incompatible ideals.

Will Brian, Paul B. Larson

Eur. J. Comb., 2021

2018

A model of $$\mathsf {ZFA}+ \mathsf {PAC}$$ ZFA + PAC with no outer model of $$\mathsf {ZFAC}$$ ZFAC with the same pure part.

Paul B. Larson, Saharon Shelah

Arch. Math. Log., 2018

2017

Coding with canonical functions.

Paul B. Larson, Saharon Shelah

Math. Log. Q., 2017

Canonical Models for Fragments of the Axiom of Choice.

Paul B. Larson, Jindrich Zapletal

J. Symb. Log., 2017

2016

Iterated elementary embeddings and the model theory of infinitary logic.

John T. Baldwin, Paul B. Larson

Ann. Pure Appl. Log., 2016

2015

Almost Galois <i>ω</i>-Stable Classes.

John T. Baldwin, Paul B. Larson, Saharon Shelah

J. Symb. Log., 2015

2012

A Brief History of Determinacy.

Paul B. Larson

Proceedings of the Sets and Extensions in the Twentieth Century, 2012

ℛ_max variations for separating club guessing principles.

Tetsuya Ishiu, Paul B. Larson

J. Symb. Log., 2012

Some results about (+) proved by iterated forcing.

Tetsuya Ishiu, Paul B. Larson

J. Symb. Log., 2012

Majority decisions when abstention is possible.

Paul B. Larson, Nicholas Matteo, Saharon Shelah

Discret. Math., 2012

2010

Regular embeddings of the stationary tower and Woodin's Sigma²₂ maximality theorem.

Richard Ketchersid, Paul B. Larson, Jindrich Zapletal

J. Symb. Log., 2010

2009

Splitting stationary sets from weak forms of Choice.

Paul B. Larson, Saharon Shelah

Math. Log. Q., 2009

The filter Dichotomy and Medial Limits.

Paul B. Larson

J. Math. Log., 2009

2008

The stationary set splitting game.

Paul B. Larson, Saharon Shelah

Math. Log. Q., 2008

Martin's Maximum and definability in H(xaleph₂).

Paul B. Larson

Ann. Pure Appl. Log., 2008

2007

The nonstationary ideal in the ℛ_max extension.

Paul B. Larson

J. Symb. Log., 2007

Increasing δ¹₂ and Namba-style forcing.

Richard Ketchersid, Paul B. Larson, Jindrich Zapletal

J. Symb. Log., 2007

On Extensions of Elementary Submodels by <i>Forcing</i>.

Lúcia R. Junqueira, Paul B. Larson, Marcelo D. Passos

Log. J. IGPL, 2007

2006

Compact spaces, elementary submodels, and the countable chain condition.

Lúcia R. Junqueira, Paul B. Larson, Franklin D. Tall

Ann. Pure Appl. Log., 2006

2005

The canonical function game.

Paul B. Larson

Arch. Math. Log., 2005

Saturation, Suslin trees and meager sets.

Paul B. Larson

Arch. Math. Log., 2005

2003

Bounding by Canonical Functions, with CH.

Paul B. Larson, Saharon Shelah

J. Math. Log., 2003

2002

A Uniqueness Theorem for Iterations.

Paul B. Larson

J. Symb. Log., 2002

2000

Separating Stationary Reflection Principles.

Paul B. Larson

J. Symb. Log., 2000

Martin's Maximum and the P_maxaxiom(*).

Paul B. Larson

Ann. Pure Appl. Log., 2000

The size of [(<i>T</i>)\tilde]\tilde{T}.

Paul B. Larson

Arch. Math. Log., 2000

1999

An S_max Variation for One Souslin Tree.

Paul B. Larson

J. Symb. Log., 1999