In their paper "The Theory of Sets of Ordinals" (arXiv), Koepke and Koerwien propose a theory SO axiomatizing the class of sets of ordinals in a model of ZFC and show that SO and ZFC are bi-interpretable. They also define *-recursiveness over SO which generalizes the ordinary recursive functions from omega to Ord, and show that the *-recursive sets (i.e. the *-definable sets) form the smallest inner model of SO; SOrd*, and that SOrd*=L. Considering that SOrd* is the smallest inner model of SO and that *-recursion generalizes the ordinary recursive functions from omega to Ord, it seems reasonable to assume that one can define productive sets of ordinals in nearly the same manner as in ordinary recursion theory, where one is defining productive sets of finite ordinals. Of course (in analogy with ordinary recursion theory), the productive sets of ordinals will not be *-definable, and therefore will not be constructible. Are there aguments against the existence of productive sets of ordinals, and, more importantly, in what way are productive sets of ordinals (if they exist) related to 0-sharp?

  • $\begingroup$ note: '-definable should be -definable 'SOrd' should be SOrd in my question $\endgroup$ – Thomas Benjamin Jun 10 '13 at 14:40
  • $\begingroup$ It should also be noted that 'SOrd' should have an asterisk at the upper right-hand corner and ' -definable' should have a centered asterisk before the '-definable' as in the Koepke-Koerwien paper. $\endgroup$ – Thomas Benjamin Jun 10 '13 at 14:46
  • $\begingroup$ Also, scratch the 'emphasized text' from the question--that was unintentional. $\endgroup$ – Thomas Benjamin Jun 10 '13 at 14:48
  • $\begingroup$ @Thomas You can still modify your question. $\endgroup$ – The User Jun 10 '13 at 14:59
  • 1
    $\begingroup$ I'm not sure what you mean by a productive set of ordinals. When I try to generalize the idea from recursion theory, I arrive at a productive class of ordinals. Could you clarify what you mean? $\endgroup$ – François G. Dorais Jun 10 '13 at 19:35

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.