Given any complete, consistent extension of , we showed that there is a* minimal* model of . This model is unique up to (unique) isomorphism, it is rigid (i.e., it has no automorphisms other than the identity), and has no proper elementary substructures.

Given a model , let , the *standard system* of , be the set of those coded by elements of , where codes iff . Thus is the class of finite sets. We showed that if is nonstandard, contains all recursive sets, and that for any non-recursive there is a nonstandard such that .

### Like this:

Like Loading...

*Related*

This entry was posted on March 13, 2008 at 1:33 pm and is filed under 116b. 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.

## Leave a Reply