We showed that a function is in iff it has a -graph. It follows that a set is r.e. iff it is -definable.
Advertisements
We showed that a function is in iff it has a -graph. It follows that a set is r.e. iff it is -definable.
This entry was posted on Tuesday, January 22nd, 2008 at 11:24 pm and is filed under 116b: Computability and incompleteness. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.