Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Infinite combinatorics"”.
-
Construction Schemes and their applications
… give several applications of this tool both to infinite combinatorics and Banach space theory. For example, we show weaker forms of capturing, such as n-capturing, form a strict hierarchy which is related to the m-Knaster Hierarchy. We also show how capturing construction schemes can be used in …
-
Alternative Cichoń Diagrams and Forcing Axioms Compatible with CH
… topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cichoń diagram. First I show that for a wide variety of reduction concepts there is a Cichoń diagram for effective …
-
Banach Spaces from Barriers in High Dimensional Ellentuck Spaces
We construct new Banach spaces using barriers in high dimensional Ellentuck spaces following the classical framework under which a Tsirelson type norm is defined from a barrier in Ellentuck space. It is shown that these spaces contain arbitrary large copies of lninfinity and specific block …
-
Banach Spaces on Infinitely Branching Trees
An example of a Banach space, X∞, with a nonseparable dual such that l1 does not imbed in X∞ is investigated. Not every weakly null sequence has a subsequence equivalent to the usual basis of c0, but c0 imbeds in many subspaces of X∞. The space l1 does imbed in X∞∗, the dual space of X∞, yet weakly …
-
Proper Forcing, The P-Ideal Dichotomy, and the S-space Problem
In this thesis, we explore the relationship between the S-space problem and the Proper Forcing Axiom (PFA). In particular, we prove that many consequences of PFA are compatible with the existence of various S-spaces. We start by studying the notion of solid graph, first introduced by Soukup, and …
-
Continuous Ramsey theory in higher dimensions
The topic of this work is infinite combinatoric and Ramsey Theory, including some consistency results with the method of forcing. The thesis has two parts which are dealing with independent but deeply related questions. In the first part we construct a model, where the homogeneity number is …
-
Partition Properties for Non-Ordinal Sets under the Axiom of Determinacy
In this paper we explore coloring theorems for the reals, its quotients, cardinals, and their combinations. This work is done under the scope of the axiom of determinacy. We also explore generalizations of Mycielski's theorem and show how these can be used to establish coloring theorems. To finish, …