Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

More results in polychromatic Ramsey theory

100%
EN
We study polychromatic Ramsey theory with a focus on colourings of [ω 2]2. We show that in the absence of GCH there is a wide range of possibilities. In particular each of the following is consistent relative to the consistency of ZFC: (1) 2ω = ω 2 and $\omega _2 \to ^{poly} (\alpha )_{\aleph _0 - bdd}^2 $ for every α <ω 2; (2) 2ω = ω 2 and $\omega _2 \nrightarrow ^{poly} (\omega _1 )_{2 - bdd}^2 $ .
2
Content available remote

Large continuum, oracles

76%
Open Mathematics
|
2010
|
tom 8
|
nr 2
213-234
EN
Our main theorem is about iterated forcing for making the continuum larger than ℵ2. We present a generalization of [2] which deal with oracles for random, (also for other cases and generalities), by replacing ℵ1,ℵ2 by λ, λ + (starting with λ = λ <λ > ℵ1). Well, we demand absolute c.c.c. So we get, e.g. the continuum is λ + but we can get cov(meagre) = λ and we give some applications. As in non-Cohen oracles [2], it is a “partial” countable support iteration but it is c.c.c.
3
Content available remote

Singular cardinals and strong extenders

76%
EN
We investigate the circumstances under which there exist a singular cardinal µ and a short (κ,µ)-extender E witnessing “κ is µ-strong”, such that µ is singular in Ult(V, E).
4
Content available remote

Ideals which generalize (v 0)

76%
Open Mathematics
|
2010
|
tom 8
|
nr 6
1016-1025
EN
Countable products of finite discrete spaces with more than one point and ideals generated by Marczewski-Burstin bases (assigned to trimmed trees) are examined, using machinery of base tree in the sense of B. Balcar and P. Simon. Applying Kulpa-Szymanski Theorem, we prove that the covering number equals to the additivity or the additivity plus for each of the ideals considered.
5
Content available remote

Completely nonmeasurable unions

76%
EN
Assume that no cardinal κ < 2ω is quasi-measurable (κ is quasi-measurable if there exists a κ-additive ideal of subsets of κ such that the Boolean algebra P(κ)/ satisfies c.c.c.). We show that for a metrizable separable space X and a proper c.c.c. σ-ideal II of subsets of X that has a Borel base, each point-finite cover ⊆ $$ \mathbb{I} $$ of X contains uncountably many pairwise disjoint subfamilies , with $$ \mathbb{I} $$-Bernstein unions ∪ (a subset A ⊆ X is $$ \mathbb{I} $$-Bernstein if A and X \ A meet each Borel $$ \mathbb{I} $$-positive subset B ⊆ X). This result is a generalization of the Four Poles Theorem (see [1]) and results from [2] and [4].
6
Content available remote

Coverings and dimensions in infinite profinite groups

76%
Open Mathematics
|
2013
|
tom 11
|
nr 2
246-253
EN
Answering a question of Miklós Abért, we prove that an infinite profinite group cannot be the union of less than continuum many translates of a compact subset of box dimension less than 1. Furthermore, we show that it is consistent with the axioms of set theory that in any infinite profinite group there exists a compact subset of Hausdorff dimension 0 such that one can cover the group by less than continuum many translates of it.
7
64%
EN
We introduce new properties of Hamel bases. We show that it is consistent with ZFC that such Hamel bases exist. Under the assumption that there exists a Hamel basis with one of these properties we construct a discontinuous and additive function that is Marczewski measurable. Moreover, we show that such a function can additionally have the intermediate value property (and even be an extendable function). Finally, we examine sums and limits of such functions.
8
Content available remote

The isomorphism relation between tree-automatic Structures

64%
EN
An ω-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for ω-tree-automatic structures. We prove first that the isomorphism relation for ω-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n ≥ 2) is not determined by the axiomatic system ZFC. Then we prove that the isomorphism problem for ω-tree-automatic boolean algebras (respectively, partial orders, rings, commutative rings, non commutative rings, non commutative groups, nilpotent groups of class n ≥ 2) is neither a Σ21-set nor a Π21-set.
9
Content available remote

On the ideal (v 0)

64%
EN
The σ-ideal (v 0) is associated with the Silver forcing, see [5]. Also, it constitutes the family of all completely doughnut null sets, see [9]. We introduce segment topologies to state some resemblances of (v 0) to the family of Ramsey null sets. To describe add(v 0) we adopt a proof of Base Matrix Lemma. Consistent results are stated, too. Halbeisen’s conjecture cov(v 0) = add(v 0) is confirmed under the hypothesis t = min{cf(c), r}. The hypothesis cov(v 0) = ω 1 implies that (v 0) has the ideal type (c, ω 1, c).
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.