Ken’s colorful questions
Abstract
The paper surveys some questions concerning coloring axioms which grew out of the discussions the author had with his PhD advisor Ken Kunen.
Dedicated to Ken, Anne and their family.
1 Introduction to coloring axioms
In studying a question of his long time colleague, M. E. Rudin, who asked whether MA and the failure of CH implies that every locally connected, hereditarily Lindelöf, compact space is metrizable Ken Kunen became interested in an example of Filippov [4]. Filippov had used a Luzin set to construct a locally connected, hereditarily Lindelöf, compact space that is not metrizable, and Filippov’s space is also hereditarily separable. Since MA + ¬CH implies that there are no Luzin sets, Kunen wondered whether MA and the failure of CH might refute the existence of such a space. In [10] he discovered some interesting facets of SOCA and used these to show that this is not the case.
Filippov’s construction relies on the geometry of spheres and Ken was able to see in this a useful weakening of a Luzin set. For let
and Kunen defines to be skinny if the closure of is not the entire surface of the sphere in . He calls a set weakly Luzin if is uncountable but every skinny subset of is countable. He then shows that the Filippov space constructed from a set has no uncountable discrete subsets if and only if is weakly Luzin. Furthermore, he shows that weakly Luzin sets and the entangled sets that play a prominent role in the study of colouring axioms have a nice common combinatorial generalization.
With these ideas he is able to show from SOCA that if is compact and is compact metric with continuous and if there is some uncountable such that for all , there are three points with disjoint open neighbourhoods of with pairwise disjoint ranges under then X has an uncountable discrete subset. These results stimulated my interest in modifications of colouring axioms.
Following Kunen’s [10, 11, 9], given a topological space we denote by the square of the space without the diagonal. A set is symmetric if whenever . We refer to a symmetric as a coloring. We shall consider various topological properties of the coloring, for example, if is open we say that it is an open coloring. If there is such that then we say that it is -connected, -homogeneous, or open-homogeneous (when is not clopen). If there is such that then we say that it is -free, -homogeneous or closed-homogeneous (when not clopen).
The fundamental concept dealt with in the paper is the Semi Open Coloring Axiom:
Definition 1.1.
Given a collection of separable metric (or topological) spaces SOCA() is the statement “Given an uncountable space and an open coloring , there is an uncountable which is either -connected or -free (in other words, is homogeneous)”. SOCA is SOCA() when is the class of all separable metric spaces.
SOCA was arguably Ken’s favourite colouring axiom; In his book [11], he worked out a complete proof of the consistency of SOCA and as mentioned above he put it to good use in [9] and [10].
The axiom itself was introduced by Abraham, Rubin and Shelah in [1] together with another principle called there the Open Coloring Axiom (OCA), which later is usually referred to as OCA[ARS] to distinguish it from the “other” open coloring axiom introduced by Todorčević [17] sometimes denoted by OCA[T] and lately called the Open Graph Axiom (OGA) by Todorčević himself.
Both axioms are consequences of the Proper Forcing Axiom (PFA). Given that the consistency of PFA requires large cardinals the following two somewhat vague questions seem natural:
Question 1.2.
How much of the strength of PFA can be expressed with coloring axioms?
Question 1.3.
How how much of PFA is equiconsistent with ZFC? Can that be expressed with a coloring axiom?
The first question has been studied extensively by Todorčević and his school. In particular, he showed [17] that Martin’s Axiom (MA) is equivalent to the statement that given a separable metric space of size less than every ccc111A coloring is ccc if given , , such that for all , there exist such that . coloring of has an uncountable homogeneous set (see also [18]). Furthermore, Moore [13] showed that OCA[ARS] and OGA together imply that .
In [1], the relative consistency of ZFC+OCA[ARS] + SOCA + “There is an increasing set222We say that is an increasing set if and only it is uncountable and for any one-to-one function between two disjoint uncountable subset of and any , there are such that for all . ” is established, while an increasing set is a counterexample to OGA as shown in [17]. Hence, SOCA is weaker than OGA, and OCA[ARS] does not imply OGA. Abraham-Rudin-Shelah also showed (in [1]) that SOCA does not imply OCA[ARS]. So the only possible implications left are:
Question 1.4.
Does OCA[ARS] imply SOCA?
Question 1.5.
Does OGA imply OCA[ARS]?
The most famous open problem about the coloring axioms is, of course:
Question 1.6 ([17]).
Is OGA consistent with ?
A positive answer to this question provides a negative answer to the previous one by the aforementioned result of Moore [13]. Moreover, the analogous question for OCA[ARS] has recently been solved in the affirmative by Gilton and Neeman [8].
We conclude this quick overview of coloring axioms by recalling another open problem raised by Todorčević in [17] (see also [19]):
Question 1.7 ([17]).
Is OGA() consistent for the class of all regular spaces without uncountable discrete subsets?
An analogous question can be also asked for SOCA:
Question 1.8.
What is the largest family of topological spaces such that SOCA() is relatively consistent with ZFC?
2 Weakenings of SOCA
In this section we consider two natural weaker versions of SOCA:
-
•
Clopen SOCA - the same as SOCA but only for clopen colorings.
-
•
Dense SOCA - the same as SOCA but only for open dense colorings.
To understand the relation between these principles it is useful to consider the following concept:
Definition 2.1.
Given a topological property , an uncountable separable metric space and a coloring over we say that can be reduced to a -coloring if there is an uncountable set such that is a coloring with property in the topology of induced from .
Obviously, given any collection of separable metric spaces, the axiom SOCA() is stronger than both Clopen SOCA(), Dense SOCA().
Proposition 2.1.
Assume SOCA. Then
-
1.
(Clopen Reduction) All open colorings on a separable metric space can be reduced to clopen colorings.
-
2.
(Dense Reduction) Every open coloring on a separable metric space can be reduced to an open dense or empty coloring.
Proof.
We shall prove both items simultaneously. Given a space and an open coloring over it, using SOCA there is an uncountable that is homogeneous. If is -connected, then which is clopen and open dense in . Otherwise, is -free so which is clopen and empty. ∎
Recall that an uncountable set is -entangled if for every uncountable collection of pairwise disjoint -element subsets of , there are pairs , , , in the collection such that and , but . The existence of a -entangled set follows e.g. from CH, while in [1] it is shown that SOCA implies that there are no -entangled sets. Interestingly, Clopen SOCA suffices and, consequently, Clopen SOCA is not a theorem of ZFC.
Theorem 2.2.
Assuming Clopen SOCA or Dense Reduction there are no -entangled sets.
Proof.
It suffices to show that given any uncountable linearly ordered separable metric space , the increasing open coloring
of can be reduced to a clopen coloring.
To see this, recursively construct as follows: Assume for have already been chosen. Since is countable . Take to be any point in it.
Now, given two distinct , we have that and , hence, is either in or in , but both are open sets. Therefore, is clopen in .
We start the proof from the Dense Reduction by noting the following:
Fact 2.1.
The only way to reduce a clopen coloring to an open dense one is to have an uncountable homogeneous open set.
To see this, let be a clopen coloring over and assume that is an uncountable set that reduces to open dense. Notice that, given , as reduces to open dense, for every open set . On the other hand, as is clopen in , there is an open set such that . Clearly, these two assumptions are contradicting each other. Therefore, making open-homogeneous. This concludes the proof of the fact.
Let be the increasing coloring on where is a -entangled set. We know that can be reduced to a clopen coloring, so lets assume that it is clopen. Notice that for any , is clopen. Using our fact, the only way to get an open dense coloring or an empty coloring would be finding an uncountable homogeneous set, which does not exist when is a -entangled set. Then the existance of a -entangled set implies the failure of Dense Reduction. ∎
The increasing coloring can be used to show that there is an open coloring which is not reducible to an open dense coloring, hence the phrase “or empty” in the Dense Reduction is necessary. To see this take a subset of consisting of the graph of a decreasing function and the graph of a countable partial increasing function, and consider the increasing coloring defined above.
Next we shall see that the axioms considered here imply that following Todorčević [17] and Moore [12]. We shall call an -increasing unbounded chain in of minimal length a -scale.
Proposition 2.2.
Each of the axioms Clopen SOCA, Dense SOCA and Clopen Reduction implies .
Proof.
The fact that Clopen SOCA implies was proved in [12].
Now, assume, towards a contradiction, that every open coloring can be reduced to a clopen coloring and . Take a -scale and let be an open coloring such that
where means that for all , . The above coloring has no uncountable homogeneous set when (see [17]). Furthermore, using the theory of oscillation of Todorčević [17], in any cofinal (for , uncountable) set of a -scale there are and , such that but , so there is a value where , so is closed but not clopen. Now, since every uncountable subset of a -scale is also a -scale (when ), can never be reduced to a clopen coloring. This contradicts our assumptions.
Finally, towards a contradiction, assume Dense SOCA and . Using a -scale of size , we can eliminate countably many points to have that every open set is uncountable. Using the same coloring as above, every open set in has a subset of the form
which is an open set. So is nowhere dense (nwd). Furthermore, by a theorem of Todorčević [17], every -scale has two functions, and such that . Then, this coloring is open dense but it has no uncountable homogeneous set. ∎
In particular, none of the four axioms considered are theorems of ZFC. It turns out that various combinations of these weakenings of SOCA recover the whole strength of SOCA.
Theorem 2.3.
The following are equivalent:
-
1.
SOCA
-
2.
Clopen SOCA + Clopen Reduction
-
3.
Dense SOCA + Dense Reduction
-
4.
Clopen Reduction + Dense Reduction
-
5.
Dense SOCA + Clopen SOCA
Proof.
We already know that SOCA implies all the other statements. The equivalence of Clauses 2 and 3 with 1 have identical natural proofs: first reducing any open coloring to one of the special kind and then apply the corresponding weakening of SOCA to that special coloring. The rest follows directly from the following two observations:
Fact 2.2.
Dense reduction implies Clopen SOCA.
Fact 2.3.
Dense SOCA implies Clopen reduction.
Fact 2.2 is a direct consequence of Fact 2.1. To show Fact 2.3, let be an open coloring over . Notice that is an open dense coloring over , since its complement is .333 denotes the boundary of . It is nowhere dense and it can be define either as or as
Using Dense SOCA over we either get a closed-homogeneous uncountable set , in which case, , so is clopen, or we get an uncountable set such that . Because both and are open in we have that reduces to a clopen coloring. This concludes the proof of the facts. ∎
We close this section with a few more natural questions:
Question 2.4.
Is Dense SOCA equivalent to Clopen Reduction?
Question 2.5.
Is Clopen SOCA equivalent to Dense Reduction?.
Question 2.6.
Is Dense SOCA weaker than SOCA?
Question 2.7.
Is Clopen SOCA weaker than SOCA?
Some of these would be settled by a positive answer to the following:
Conjecture 2.8.
Every open coloring can be reduced to a clopen or to an open dense coloring.
As mentioned in the previous section, it is not known if OCA[ARS] implies SOCA. If it turns out that the answer is negative, then the fact that OCA[ARS] implies Clopen SOCA (a clopen coloring is also a cover of by open sets) settles Question 2.7 in the positive.
3 Colorings and Baire spaces
Galvin [5] (see also [9]) showed that SOCA is true for every Polish space. In particular, in uncountable Polish spaces all open colorings can be reduced to clopen ones. Hence also any space that contains an uncountable Polish space has the same reduction property. These ZFC results suggest the following:
Question 3.1.
What is the largest family of topological spaces such that ZFC implies SOCA()?
In a related work, Ramos-García and Corona-García [3] study the class of topological spaces for which OGA follows from ZFC.
Recall that a metric space is a Baire space if no non-empty open subsets of is meager, i.e. is not a union of countably many nowhere dense sets. Polish spaces are Baire by the Baire Category Theorem. Nevertheless, not all Baire spaces are Polish or contain a Polish space. For example Luzin sets or Generalized Luzin sets ([11]) are Baire spaces with no Polish subspace (these sets exists, for example, under CH or MA+ CH, respectively).
Furthermore, as shown in Kunen’s book [11], it is possible to have a Luzin set as counterexample to SOCA, so it is consistent that not all Baire metric spaces satisfy SOCA. We will show here that, if Clopen SOCA is true for Baire spaces, then SOCA is also true for them. In order to prove this, the following notation will be useful:
Notation 3.1.
Given and let
Theorem 3.2.
Every open coloring over a separable metric Baire space can be reduced to a clopen one.
Proof.
Let be a separable metric Baire space and let be open and symmetric.
By definition, is meager (nowhere dense) and, by the Kuratowski-Ulam Theorem, we have that the set
is meager.
We can recursively construct a sequence contained in such that, given , . Once we construct this sequence we will be done: by symmetry of , if and only if . So, the above sequence will have the property that, given and , . In other words, there is an open set of such that and either or . Therefore, will be clopen in .
For the construction, assume that we already selected for , for . Since is countable, is a Baire space and we have that . We just let be an element of .∎
Corollary 3.3.
Dense SOCA(Baire) is true in ZFC.
Proof.
If in the proof above we assume that is open dense, then . So, the proof above generates a -connected set. ∎
Corollary 3.4.
SOCA(Baire) and Clopen SOCA(Baire) are equivalent.
The following is a variation on a classical proof of Todorčević in [17].
Theorem 3.5.
Assuming CH there is a 2-entangled Luzin set.
Proof.
Let be an enumeration of all continuous functions from subsets of to and let be an enumeration of the reals. Finally, let be an enumeration of all closed nwd sets.
We will construct the -entangled Luzin set by recursion. Assume that we already have . Let
where
Notice that is meager (it is countable) and is a countable union of nwd (by CH), so they do not cover . This shows that is non empty and is well defined.
It is clear from the construction, and from the assumption that , that is a Luzin set. To show that is -entangled we follow the proof of Lemma 4.2 by Todorčević in [17]. Let be a collection of size continuum of disjoint -tuples of .
Let
We can assume that this set is of size continuum. If not, we can run the argument interchanging the roles of and .
Now, we can define the function such that
Furthermore, define the set
where444Here is the ball of radius with center in , a subset of . is the oscillation of at , i.e., all the accumulation points of the images (under ) of sequences that converge to . Notice that if and only if is continuous at .
Recall that any partial continouos function from to can be extended to a partial function whose domain is a set. With this and our construction of we have that the set is of size continuum.
Given , let , be two distinct elements in . Without loss of generality, we can assume that . Let such that . Since we only have countably many rational numbers, we may shrink in such a way that for all the rational number is the same. Notice that still has size continuum.
Take such that and take disjoint intervals such that and . By the definition of , , and there are and such that . Then for the pairs , we have and ; and for the pair , we have but . ∎
Note 1.
In the proof of Theorem 3.5, we index the sequence with since the entangled part is true in ZFC. The use of CH is only to ensure that the set is Luzin.
As every Luzin set is Baire, we have the following:
Corollary 3.6.
In a model where CH is true, SOCA(Baire) is false.
With this we can conclude that Dense SOCA(Baire) is weaker than Clopen SOCA(Baire) and SOCA(Baire).
4 SOCA for larger uncountable sets
In this section we shall consider higher cardinal extensions of SOCA. This is motivated indirectly by the recent attempts to “lift” Baumgartner’s Theorem [2] to , i.e. to prove the consistency of every two -dense sets of reals are order isomorphic (see [14, 7]), and directly by the work of Shelah, Abraham and Rudin’s [1] where they ask if it is possible to have a version of SOCA for . It fits in the general program to investigate the behaviour of the continuum when it is bigger than (as discussed in [16]).
A straightforward generalization of SOCA is to ask that the set is as big as the space or bigger than a certain cardinal.
Definition 4.1.
SOCA() is the statement: For all separable metric spaces of size bigger or equal to and all open symmetric subsets of there exist such that and either (open-homogeneous) or (closed-homogeneous).
For some spaces, this axiom can be derived from SOCA and MA.
Theorem 4.2 (SOCA and MA).
Given a separable metric space of size , with , and open and symmetric such that all closed-homogeneous sets are countable, there is an open-homogeneous set of size .
Proof.
Let
It is enough to show that this is a ccc poset. Once we have this, since it is of size , MA will imply that it is the union of countably many filters. Notice that the union of each filter is an open-homogeneous set and, since for all , we have that is a countable union of open-homogeneous sets so, it has an open-homogeneous set of size (using its cofinality).
In order to show that is ccc take . We will show that there exist such that is compatible with .
Since for all we may assume that is a -system with root . Furthermore, we may assume that . So, we can write
Let be a countable basis of . For each we can choose such that for all , and for all , (this is possible since is open and for all and all ).
We will prove by induction on that there exists uncountable many elements that are compatible.
For , let . We know that do not have any uncountable closed-homogeneous set, so we can use SOCA() to choose an uncountable open-homogeneous set. Let be the indexes of the elements of this open-homogeneous set. Notice that all the elements of are compatible.
Assume we have the result for , we will prove it for .
First, using the induction hypothesis, take such that are compatible. Now, let . We know that do not have any uncountable closed-homogeneous set, so we can use SOCA() to choose an uncountable open-homogeneous set. Let be the indexes of the elements in that uncountable open-homogeneous set. Notice that all the elements of are compatible: first, all the elements of are compatible; also, we have that for all and, finally, we have that for all and all . ∎
The assumption that cannot be improved. Following Note 1 after Theorem 3.5, we can modify Lemma 4.2 of [17] to show:
Theorem 4.3.
There is a set of size continuum such that for every collection of size continuum of disjoint -tuples of there are , , , such that and , but .
Theorem 4.3 shows that the increasing coloring for cannot have a size continuum homogeneous set, so SOCA() can only be valid for .
In order to prove SOCA, the autors of [1] used sequences of elementary submodels and assumed that their spaces only had countable closed-homogeneous sets using a combinatorial principle (there always exists fast clubs for (special) families of size continuum). Following these ideas Moore and Todorčević in [14] introduced the principle (**) which we shall call MTA:
Definition 4.4 (Moore, Todorčević [14]).
The Moore-Todorčević Axiom for (,, ) (MTA or MTA()) is the statement:
If is a collection of one-to-one functions from to and then there is which is one-to-one such that
-
•
for every , is countable (or of size ).
-
•
for every , there is a countable (or of size ) set such that if then .
In the same paper were MTA is introduced, the following equivalence is proved:
Lemma 4.5.
For each , fix a bijection . MTA is equivalent to the following statement: whenever is a collection of at most many one-to-one functions from to , there is a one-to-one such that, whenever is closed under and , there is a countable such that:
-
•
if then
-
•
if then
Notice that, using the Axiom of Choice, if the functions are countable-to-one, you can also construct a with the above mentioned properties. The following lemma was also discovered, independently, by Thomas Gilton [6].
Lemma 4.6.
Given a separable metric space of size and an open and symmetric such that all closed-homogeneous sets are countable there is an of size such that the finite open-homogeneous subsets of ordered by reverse inclusion form a ccc forcing.
Proof.
The proof for this Lemma is inspired, indeed, by Todorčević and Moore [13] and by the proof of the consistency of SOCA with in Abraham-Rudin-Shelah [1]. The inspiration of the former will be seen on the use of MTA. On the other hand, the strategy that Abraham-Rudin-Shelah used to prove their result was that given a metric space, they created a “tower of models” for each closed set of the metric space and its cartesian powers. After that, they “combined” all of them using their Axiom A1 (which, essentially, guarantees a fast club) and, finally, use the club method.
We will have a similar approach (even using the club method at the end). Nevertheless, we will change A1 for MTA and create “towers of models” for all the pairs of closed sets and an uncountable ordinal of . We do this as follows:
Let and be a basis for its topology. Fix , and bijections between and for each .
For each closed subset of , say , and each we define a continuous -chain of countable elementary submodels of such that given we ensure that . Whenever and are clear from the context we will use the notation for .
Notice that, since there are only pairs , we just define “towers of models” each one of them with models such that for all , and
Once again, for a closed subset of and , we define such that:
using the sequence of elementary submodels corresponding to and . These functions are well define, since each is countable, and each of of them is a countable-to-one function.
The combinatorial principle MTA ensures the existance of a one-to-one function satisfying the conditions of Lemma 4.5 for the set .
Let . We claim that this set works.
To prove this, it is enough to show that given an uncountable collection of finite open-homogeneous sets, the union of two of them is open-homogeneous.
Assume that we have -many finite open-homogeneous sets, say . We know that there is an uncountable such that for all , if , then . Furthermore, we can find this such that it is closed under .
Without lost of generality, we can assume that they form a -system with empty root and they all have size . As in Theorem 4.2, we can naturally associate a vector in to each . To do so, we enumerate in such a way that if and only if .
Shrinking if necessary, we can assume that, if , then
After these reductions, let be the closure of in .
We will work with the continuous -chain of models associated with and .
Given , we say that the height of , denoted , is the minimum such that . Given our definition for these chains of models, we have that for . On the other hand, the definition of ensure that, if and then for all , and for all .
We claim that, for all but countably many ordinals in , if then . To see this, from the second bullet of MTA, we have that there is a countable such that if and then . This means that . Since , we have that .
The above inequality allow us to find a really useful family of uncountable sets: given such that for all , let and . Since for , we have that . Then, . Also, , which implies that . This shows that is uncountable. To see this, remember that given a countable set , if then . Therefore, the fact that , but shows that is uncountable.
From here, it is enough to follow the exposition of the consistency of SOCA() as in [11] Lemmas V.6.14 and V.6.15. The technique presented there is the club method used in [1]. The club method has two steps: the preparation and the cloning. For the preparation, we select open sets for each as we exposed here for Theorem 4.2.
Cloning resembles the technique in Theorem 3.5 where we use the oscillation of a discontinuous function, although the contexts are really different. The analogy comes from the fact that both techniques first find points in a set of accumulation points ( and here and the oscillation in Theorem 3.5) to fix open sets (, , and in Theorem 3.5). Afterwards, both technique uses those open sets to find actual elements of the original uncountable set that are compatible (elements of here and elements of in Theorem 3.5). ∎
We see these results as steps towards the consistency of SOCA().
Conjecture 4.7.
SOCA() is consistent.
Proving the conjecture would culminate the work that Ken and I talked so much about.
5 Once you see the stars
Once you see the stars, is impossible to forget them. I was Kenneth Kunen’s last student. He accepted to be my advisor even though he was already retired.
Being Ken’s student forced me to face freedom and taught me how to find questions on my own. I learned early on that Ken was not going to tell me which path to follow, but he was also not going to let me go astray if I needed him.
In 2020, Ken fell ill but, being as responsible and caring as he was, he attended the defence of my disertation [15] virtually. According to his family, a couple of days later he was hospitalized. He died on August 14, 2020, the same day as my birthday.
6 Acknowledgements
The author wants to kindly thank the editors of this issue, Juris Steprāns and the referee for all the suggestions and comments. They helped to improve this article to its current form. I also thank my son and wife for all the support they gave me during my PhD and the hard time that came after it.
References
- [1] U. Abraham, M. Rubin, and S. Shelah. On the consistency of some partition theorems for continuous colorings, and the structure of -dense real order types. Ann. Pure Appl. Logic, 29(2):123–206, 1985.
- [2] J. E. Baumgartner. All -dense sets of reals can be isomorphic. Fund. Math., 79(2):101–106, 1973.
- [3] J. A. Corona-García and U. A. Ramos-García. OCA in strong choquet spaces. unpublished article, 2019.
- [4] V. V. Filippov. Perfectly normal bicompacta. Dokl. Akad. Nauk SSSR, 189:736–739, 1969.
- [5] F. Galvin. Partition theorems for the real line. Notices Amer. Math. Soc, 15(660):6, 1968.
- [6] T. Gilton. Personal communucation. Made on April of 2016 during the 9th Appalachian Set Theory Workshop, 2015.
- [7] T. Gilton and I. Neeman. Side conditions and iteration theorems. In Proceeeding of the 9th Appalachian Set Theory Workshop, 2017.
- [8] T. Gilton and I. Neeman. Abraham-Rubin-Shelah open colorings and a large continuum. arXiv preprint arXiv:1904.10516, 2019.
- [9] J. E. Hart and K. Kunen. Arcs in the plane. Topology and its Applications, 158(18):2503–2511, 2011.
- [10] K. Kunen. Locally connected hereditarily Lindelöf compacta. Topology Appl., 158(18):2473–2478, 2011.
- [11] K. Kunen. Set theory, volume 34 of Studies in Logic (London). College Publications, London, 2011.
- [12] J. T. Moore. Continuous colorings associated with certain characteristics of the continuum. Discrete Math., 214(1-3):263–273, 2000.
- [13] J. T. Moore. Open colorings, the continuum and the second uncountable cardinal. Proc. Amer. Math. Soc., 130(9):2753–2759, 2002.
- [14] J. T. Moore and S. Todorcevic. Baumgartner’s isomorphism problem for -dense suborders of . Arch. Math. Logic, 56(7-8):1105–1114, 2017.
- [15] I. Ongay-Valverde. Relations between Set Theory and Computability Theory: the case for localization numbers and sets closed under Turing equivalence. The University of Wisconsin-Madison, 2020.
- [16] S. Todorčević. Comparing the continuum with the first two uncountable cardinals. In Logic and Scientific Methods, pages 145–155. Springer, 1997.
- [17] S. Todorčević. Partition problems in topology, volume 84 of Contemporary Mathematics. American Mathematical Society, Providence, RI, 1989.
- [18] S. Todorčević and B. Veličković. Martin’s axiom and partitions. Compositio Math., 63(3):391–408, 1987.
- [19] B. Veličković. Applications of the Open Coloring Axiom. In Set theory of the continuum (Berkeley, CA, 1989), volume 26 of Math. Sci. Res. Inst. Publ., pages 137–154. Springer, New York, 1992.