All Questions
3 questions
2
votes
0
answers
133
views
Higher-order oracle computation of reals and axiom of constructibility
Certain real numbers can be approximated arbitrarily well by computable functions. If we introduce halting oracles, then more real numbers can be "computed", like Chaitin's constant or the ...
- 173
2
votes
3
answers
855
views
What is the largest large-cardinal hypothesis consistent with $ZFC + V=L$?
What is the largest large-cardinal hypothesis consistent with $ZFC + V=L$? The reason for the question is this: under the assumption that all of 'ordinary mathematics' (as reverse mathematics ...
- 6,132
2
votes
1
answer
609
views
Would a non-constructible set become constructible if we had oracles of arbitrarily high cardinality for the halting problems of ordinal computers?
I still have trouble to grasp the concept of a non-constructible set, my intuition is that we could "avoid" the non-constructibility of many of them if we assume we have "ordinal computers" extended ...
- 297