We prove the following theorem: Given a⊆ω and , if for some and all u ∈ WO of length η, a is , then a is . We use this result to give a new, forcing-free, proof of Leo Harrington’s theorem: -Turing-determinacy implies the existence of .
We investigate when two orthogonal families of sets of integers can be separated if one of them is analytic.
We prove that there is no maximum element, under Borel reducibility, in the class of analytic partial orders and in the class of analytic oriented graphs. We also provide a natural jump operator for these two classes.
A tie-point of compact space is analogous to a cut-point: the complement of the point falls apart into two relatively clopen non-compact subsets. We review some of the many consistency results that have depended on the construction of tie-points of . One especially important application, due to Veličković, was to the existence of nontrivial involutions on . A tie-point of has been called symmetric if it is the unique fixed point of an involution. We define the notion of an almost clopen set...
This note is about functions ƒ : Aω → Bω whose graph is recognized by a Büchi finite automaton on the product alphabet A x B. These functions are Baire class 2 in the Baire hierarchy of Borel functions and it is decidable whether such function are continuous or not. In 1920 W. Sierpinski showed that a function is Baire class 1 if and only if both the overgraph and the undergraph of f are Fσ. We show that such characterization is also true for functions on infinite words if we replace the real...