Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 7

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Analytic gaps

100%

Todorčević S.

Fundamenta Mathematicae

1996

tom 150

nr 1

55-66

We investigate when two orthogonal families of sets of integers can be separated if one of them is analytic.

The functor σ²X

100%

Todorčević S.

Studia Mathematica

1995

tom 116

nr 1

49-57

We disprove the existence of a universal object in several classes of spaces including the class of weakly Lindelöf Banach spaces.

A dichotomy for P-ideals of countable sets

100%

Todorčević S.

nr 3

251-267

A dichotomy concerning ideals of countable subsets of some set is introduced and proved compatible with the Continuum Hypothesis. The dichotomy has influence not only on the Suslin Hypothesis or the structure of Hausdorff gaps in the quotient algebra $P(\mathbb{N})$/ but also on some higher order statements like for example the existence of Jensen square sequences.

Gaps in analytic quotients

100%

Todorčević S.

Fundamenta Mathematicae

1998

tom 156

nr 1

85-97

We prove that the quotient algebra P(ℕ)/I over any analytic ideal I on ℕ contains a Hausdorff gap.

Chain conditions in maximal models

63%

Larson P. , Todorčević S.

Fundamenta Mathematicae

2001

tom 168

nr 1

77-104

We present two $ℙ_{max}$ varations which create maximal models relative to certain counterexamples to Martin's Axiom, in hope of separating certain classical statements which fall between MA and Suslin's Hypothesis. One of these models is taken from [19], in which we maximize relative to the existence of a certain type of Suslin tree, and then force with that tree. In the resulting model, all Aronszajn trees are special and Knaster's forcing axiom 𝒦₃ fails. Of particular interest is the still open question whether 𝒦₂ holds in this model.

Chains and antichains in Boolean algebras

63%

Losada M. , Todorčević S.

nr 1

55-76

We give an affirmative answer to problem DJ from Fremlin's list [8] which asks whether $MA_{ω_1}$ implies that every uncountable Boolean algebra has an uncountable set of pairwise incomparable elements.

The isomorphism relation between tree-automatic Structures

63%

Finkel O. , Todorčević S.

Open Mathematics

2010

tom 8

nr 2

299-313

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.