Dichotomy Theorems for Families of Non-cofinal Essential Complexity
نویسندگان
چکیده
We prove that for every Borel equivalence relation E, either E is Borel reducible to E0, or the family of Borel equivalence relations incompatible with E has cofinal essential complexity. It follows that if F is a Borel equivalence relation and F is a family of Borel equivalence relations of non-cofinal essential complexity which together satisfy the dichotomy that for every Borel equivalence relation E, either E ∈ F or F is Borel reducible to E, then F consists solely of smooth equivalence relations, thus the dichotomy is equivalent to a known theorem.
منابع مشابه
Continuous and Other Finitely Generated Canonical Cofinal Maps on Ultrafilters
This paper concentrates on the existence of canonical cofinal maps of three types: continuous, generated by finitary monotone end-extension preserving maps, and generated by monotone finitary maps. The main theorems prove that every monotone cofinal map on an ultrafilter of a certain class of ultrafilters is actually canonical when restricted to some filter base. These theorems are then applied...
متن کاملHorn versus full first-order: complexity dichotomies in algebraic constraint satisfaction
We study techniques for deciding the computational complexity of infinite-domain constraint satisfaction problems. For certain fundamental algebraic structures ∆, we prove definability dichotomy theorems of the following form: for every first-order expansion Γ of ∆, either Γ has a quantifier-free Horn definition in ∆, or there is an element d of Γ such that all non-empty relations in Γ contain ...
متن کاملComputational Complexity of Holant Problems
We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant problems. Compared to counting constraint satisfaction problems (#CSP), it is a refinement with a more explicit role for the constraint functions. Both graph homomorphism and #CSP can be viewed as special cases of Holant problems. We prove complexity dichotomy theorems in this framew...
متن کاملSome Dichotomy Theorems for Neural Learning Problems
The computational complexity of learning from binary examples is investigated for linear threshold neurons. We introduce combinatorial measures that create classes of infinitely many learning problems with sample restrictions. We analyze how the complexity of these problems depends on the values for the measures. The results are established as dichotomy theorems showing that each problem is eit...
متن کاملWeakly Countably Determined Spaces of High Complexity
We prove that there exist weakly countably determined spaces of complexity higher than coanalytic. On the other hand, we also show that coanalytic sets can be characterized by the existence of a cofinal adequate family of closed sets. Therefore the Banach spaces constructed by means of these families have at most coanalytic complexity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017