4 citations · 8 across the 8 of their papers we have counts for
3 papers · 1 filter
Turing degrees in Polish spaces and decomposability of Borel functions
Vassilios Gregoriades, Takayuki Kihara, Keng Meng Ng
We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a sep…
Finitary reducibility on equivalence relations
Russell Miller, Keng Meng Ng
We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and…
An analogy between cardinal characteristics and highness properties of oracles
Jörg Brendle, Andrew Brooke-Taylor, Keng Meng Ng +1
We present an analogy between cardinal characteristics from set theory and highness properties from computability theory, which specify a sense in which a Turing oracle is computat…