15 problems
Steel's conjecture. Assume . Every -invariant function is equivalent to a uniformly -invariant function on a cone.
Martin's conjecture. Assume . Then:
Let be Cantor space, and let mean that and have the same Turing degree. Regard as a countable Borel equivalence relation under Bo…
For , let consist of sequences such that, for every ,…
Let be the problem discussed in the paper, and let and denote its countable and inverse-limit iterations, respectively. T…
Let be a finite lattice. A finite lattice is join-semidistributive if it satisfies the join-semidistributive law, and it is interval dismantlable if it belongs to t…
A partial order is locally countable if every element has at most countably many predecessors. The continuum is the cardinality of the real numbers, and the Turing deg…
C.e. Sigma-intermediate/Delta-low conjecture. There is a computably enumerable set that is intermediate for -Feiner and low for -Feiner.
Differing Feiner behavior conjecture. Some intermediate Turing degrees behave differently for -Feiner and for -Feiner.
For a Turing degree , let denote the set of real numbers of degree at most , and for Turing degrees and , let be their join and…
Let and let be a real such that … For a real , define the -th pseudo-hyperjump by , where is the -th mem…
Let . They are simultaneously continuously random if there exist a real and a measure such that computes and both and are…
A set has coarse computability bound when its coarse computability bound is one, but is not coarsely computable. The surrounding results show that if either the Turin…
Lowness conjecture. Under these assumptions, is -presentable.
Let be a set of natural numbers, let denote its Turing jump, and let denote the second Turing jump of the computable degree. A set is almost everywhere dominating whe…