Uniformization, choice functions and well orders in the class of trees
Shmuel Lifsches, Saharon Shelah
Abstract
The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with parameters)? A natural dichotomy arises where the trees that fall in the first class don't have a definable choice function and the trees in the second class have even a definable well ordering of their elements. This has a close connection to the uniformization problem.
Create a lesson
Related papers
Friedman--Stanley cofinality without Borel completeness
Ruijun Wang
On Farah ideals and beyond
Adam Kwela
The 1-2-3 Conjecture for Borel Combinatorics
Junhao Chen, Wei Dai
No Borel upper bound for the Fσ equivalence relations
Ruijun Wang
Omitting Types for Infinitary Real-Valued Logic: A Topological Perspective
Olivia Aubone, Eduardo Dueñez, José Iovino
1-Genericity Is Not Weihrauch Reducible to the Finite Intersection Principle
Patrizio Cintioli