We proved that a set is recursive iff it is
-definable.
We showed some elementary properties of the theory
, defined end-extensions, and verified that
is
-complete.
We also defined what it means for a function, or a set, to be represented in a theory.
Like this:
Like Loading...
Related
This entry was posted on Thursday, January 24th, 2008 at 2:49 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.