Skip to main content
Bjørn Kjos-Hanssen's user avatar
Bjørn Kjos-Hanssen's user avatar
Bjørn Kjos-Hanssen's user avatar
Bjørn Kjos-Hanssen
  • Member for 14 years, 9 months
  • Last seen this week
comment
Loading…
awarded
Loading…
comment
Do all linear orders in this class have computable copies?
Regarding the footnote, does the negative result also work if you assume $ e $ is the index of a PAC tree with infinitely many (isolated) paths?
awarded
awarded
awarded
comment
Is every non-recursive set in $\Sigma_1$ complete in $\Sigma_1$ (relatively to many-to-one reductions)?
Well, even Hilbert ' 10th problem has to be encoded to get a subset of $\omega $... which can be done in many ways
comment
Is every non-recursive set in $\Sigma_1$ complete in $\Sigma_1$ (relatively to many-to-one reductions)?
Nice although I suppose the $ m $-degree of this set depends on the version of $\Omega $ used? Also instead of $\Omega $ we could use $0'$ which is even more natural?
Loading…
comment
Convex extensibility of combination of two lines
Oh, I see... but this seems to make crucial use of the fact that we can extend lines to infinity, which actually in my intended application we can't.
comment
Convex extensibility of combination of two lines
Nice. Any thoughts on whether there is a continuous one?
accepted
Loading…
Loading…
comment
Characterization of a set in $\mathbb{R}^d$
I'm not sure, maybe ask that as a new question...
revised
Loading…
answered
Loading…
1
60 61
62
63 64
84