A note on standard systems and ultrafilters

Details A note on standard systems and ultrafilters A note on standard systems and ultrafilters

2008-04-25

arxiv.org/abs/0804.4078v1

J. Symbolic Logic Volume 73, Issue 3 (2008), 824-830

Mathematics

Logic

8 pages. To appear in the Journal of Symbolic Logic

Scientific paper

10.2178/jsl/1230396749

Let $(M,\scott X) \models \ACA$ be such that $P_\scott X$, the collection of all unbounded sets in $\scott X$, admits a definable complete ultrafilter and let $T$ be a theory extending first order arithmetic coded in $\scott X$ such that $M$ thinks $T$ is consistent. We prove that there is an end-extension $N \models T$ of $M$ such that the subsets of $M$ coded in $N$ are precisely those in $\scott X$. As a special case we get that any Scott set with a definable ultrafilter coding a consistent theory $T$ extending first order arithmetic is the standard system of a recursively saturated model of $T$.

Affiliated with

Also associated with

No associations

Rating

A note on standard systems and ultrafilters does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on standard systems and ultrafilters, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on standard systems and ultrafilters will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728121