Affiliation:
1. School of Mathematical Sciences, Nankai University, Tianjin 300071, China
Abstract
We study the coarse classification of partial orderings using chain conditions in the context of descriptive combinatorics. We show that (unlike the Borel counterpart of many other combinatorial notions), we have a strict hierarchy of different chain conditions, similar to the classical case.
Funder
National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference10 articles.
1. Borel orderings;Harrington;Trans. Am. Math. Soc.,1998
2. When a partial Borel order is linearizable;Kanovei;Fund. Math.,1997
3. Borel chromatic numbers;Kechris;Adv. Math.,1999
4. The graph-theoretic approach to descriptive set theory;Miller;Bull. Symb. Log.,2012
5. Measures in Boolean algebras;Horn;Trans. Am. Math. Soc.,1948