Logic Seminar
Dave Marker
UIC
The decidability of the natural numbers with almost-all quantifiers
Abstract: Consider the theory of the natural numbers where we use the quantifiers "almost all" and "exists
unboundedly many" instead of "for all" and "there exists". Ted Slaman proved the surprising result that
this theory is decidable. We will show that this result has an easy model theoretic proof.
Tuesday February 28, 2006 at 4:00 PM in SEO 427