Andrzej Roslanowski

dblp:40/3249 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 9 · 4 first-author · 1 since 2021
YearPublicationVenuePosition
2025 Borel sets without perfectly many overlapping translations, III
abstract
We expand the results of Rosłanowski and Shelah [11] , [10] to all perfect Abelian Polish groups ( H , + ) . In particular, we show that if α < ω 1 and 4 ≤ k < ω , then there is a ccc forcing notion adding a Σ 2 0 set B ⊆ H which has ℵ α many pairwise k –overlapping translations but not a perfect set of such translations. The technicalities of the forcing construction led us to investigations of the question when, in an Abelian group, X − X ⊆ Y − Y imply that a translation of X or − X is included in Y .
Andrzej Roslanowski, Saharon Shelah
Ann. Pure Appl. Log.1
2006 n - localization property
abstract
Abstract This paper is concerned with n–localization property introduced by Newelski and Roslanowski in [10] and getting it for CS iterations of forcing notions.
Andrzej Roslanowski
J. Symb. Log.1
2000 More on Cardinal Invariants of Boolean Algebras
Andrzej Roslanowski, Saharon Shelah
Ann. Pure Appl. Log.1
2000 After All, There Are Some Inequalities Which Are Provable in ZFC
abstract
Abstract We address ZFC inequalities between some cardinal invariants of the continuum, which turned out to be true in spite of strong expectations given by [11].
Tomek Bartoszynski, Andrzej Roslanowski, Saharon Shelah
J. Symb. Log.2
1998 Ideals without CCC
abstract
Abstract Let I be an ideal of subsets of a Polish space X, containing all singletons and possessing a Borel basis. Assuming that I does not satisfy ccc, we consider the following conditions (B), (M) and (D). Condition (B) states that there is a disjoint family F ⊆ P(X) of size ϲ, consisting of Borel sets which are not in I. Condition (M) states that there is a Borel function f : X → X with f−1[{x}] ∉ I for each x ∈ X. Provided that X is a group and I is invariant, condition (D) states that there exist a Borel set B ∉ I and a perfect set P ⊆ X for which the family {B+x : x ∈ P} is disjoint. The aim of the paper is to study whether the reverse implications in the chain (D) ⇒ (M) ⇒ (B) ⇒ not-ccc can hold. We build a σ-ideal on the Cantor group witnessing (M) & ¬(D) (Section 2). A modified version of that σ-ideal contains the whole space (Section 3). Some consistency results on deriving (M) from (B) for “nicely” defined ideals are established (Sections 4 and 5). We show that both ccc and (M) can fail (Theorems 1.3 and 5.6). Finally, some sharp version's of (M) for invariant ideals on Polish groups are investigated (Section 6).
Marek Balcerzak, Andrzej Roslanowski, Saharon Shelah
J. Symb. Log.2
1997 Simple Forcing Notions and Forcing Axioms
abstract
In the present paper we are interested in simple forcing notions and Forcing Axioms. A starting point for our investigations was the article [4] in which several problems were posed. We answer some of those problems here. In the first section we deal with the problem of adding Cohen reals by simple forcing notions. Here we interpret simple as of small size. We try to establish as weak as possible versions of Martin Axiom sufficient to conclude that some forcing notions of size less than the continuum add a Cohen real. For example we show that MA(σ-centered) is enough to cause that every small σ-linked forcing notion adds a Cohen real (see Theorem 1.2) and MA(Cohen) implies that every small forcing notion adding an unbounded real adds a Cohen real (see Theorem 1.6). A new almost ωω-bounding σ-centered forcing notion ℚ⊚ appears naturally here. This forcing notion is responsible for adding unbounded reals in this sense, that MA(ℚ⊚) implies that every small forcing notion adding a new real adds an unbounded real (see Theorem 1.13). In the second section we are interested in Anti-Martin Axioms for simple forcing notions. Here we interpret simple as nicely definable. Our aim is to show the consistency of AMA for as large as possible class of ccc forcing notions with large continuum. It has been known that AMA(ccc) implies CH, but it has been (rightly) expected that restrictions to regular (simple) forcing notions might help.
Andrzej Roslanowski, Saharon Shelah
J. Symb. Log.1
1996 Adding One Random Real
abstract
Abstract We study the cardinal invariants of measure and category after adding one random real. In particular, we show that the number of measure zero subsets of the plane which are necessary to cover graphs of all continuous functions may be large while the covering for measure is small.
Tomek Bartoszynski, Andrzej Roslanowski, Saharon Shelah
J. Symb. Log.2
1995 Martin's Axiom and the Continuum
abstract
Since Georg Cantor discovered set theory the main problem in this area of mathematical research has been to discover what is the size of the continuum. The continuum hypothesis (CH) says that every infinite set of reals either has the same cardinality as the set of all reals or has the cardinality of the set of natural numbers, namely In 1939 Kurt Gödel discovered the Constructible Universe and proved that CH holds in it. In the early sixties Paul Cohen proved that every universe of set theory can be extended to a bigger universe of set theory where CH fails. Moreover, given any reasonable cardinal κ, it is possible to build a model where the continuum size is κ. The new technique discovered by Cohen is called forcing and is being used successfully in other branches of mathematics (analysis, algebra, graph theory, etc.). In the light of these two stupendous works the experts (especially the platonists) were forced to conclude that from the point of view of the classical axiomatization of set theory (called ZFC) it is impossible to give any answer to the continuum size problem: everything is possible! In private communications Gödel suggested that the continuum size from a platonistic point of view should be ω2, the second uncountable cardinal. As this is not provable in ZFC, Gödel suggested that a new axiom should be added to ZFC to decide that the cardinality of the continuum is ω2.
Haim Judah, Andrzej Roslanowski
J. Symb. Log.2
1993 Combinatorial Properties of the Ideal P2
abstract
Abstract By ℬ2 we denote the σ-ideal of all subsets A of the Cantor set {0, 1}ω such that for every infinite subset T of ω the restriction A∣{0, 1}T is a proper subset of {0, 1}T. In this paper we investigate set theoretical properties of this and similar ideals.
Jacek Cichon, Andrzej Roslanowski, Juris Steprans, Bogdan Weglorz
J. Symb. Log.2