Andrzej Roslanowski

According to our database1, Andrzej Roslanowski authored at least 19 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Borel sets without perfectly many overlapping translations.
Reports Math. Log., 2019

2014
Monotone hulls for \({\mathcal {N}}\cap {\mathcal {M}}\).
Period. Math. Hung., 2014

2013
More about λ-support iterations of (<λ)-complete forcing notions.
Arch. Math. Log., 2013

2011
Reasonable Ultrafilters, Again.
Notre Dame J. Formal Log., 2011

2008
Generating ultrafilters in a reasonable way.
Math. Log. Q., 2008

2007
Universal forcing notions and ideals.
Arch. Math. Log., 2007

2006
How much sweetness is there in the universe?
Math. Log. Q., 2006

n - localization property.
J. Symb. Log., 2006

2004
Sweet & sour and other flavours of ccc forcing notions.
Arch. Math. Log., 2004

2002
Towards Martins minimum.
Arch. Math. Log., 2002

2000
After All, There Are Some Inequalities Which Are Provable in ZFC.
J. Symb. Log., 2000

More on Cardinal Invariants of Boolean Algebras.
Ann. Pure Appl. Log., 2000

1998
Ideals without CCC.
J. Symb. Log., 1998

1997
Simple Forcing Notions and Forcing Axioms.
J. Symb. Log., 1997

1996
Adding One Random Real.
J. Symb. Log., 1996

Localizations of infinite subsets of w.
Arch. Math. Log., 1996

More forcing notions imply diamond.
Arch. Math. Log., 1996

1995
Martin's Axiom and the Continuum.
J. Symb. Log., 1995

1993
Combinatorial Properties of the Ideal P<sub>2</sub>.
J. Symb. Log., 1993


  Loading...