[FOM] A question about \omega-consistent theories
Arnon Avron
aa at tau.ac.il
Mon Apr 27 12:06:13 EDT 2009
Can anybody give me an example of a (not necessarily recursive
or r.e.) \omega-consistent theory in the language of PA which
proves all true quantifiers-free sentences in this language,
but also some sentence which is not true (in the standard model of PA)?
Thanks
Arnon Avron
----------------------------------------------------------------
Prof. Arnon Avron | +972-3-640-6352 Office
School of Computer Science | +972-3-640-6352 Fax
Tel Aviv University | +972-3-641-0043 Home
Tel Aviv, 69978 | +972-3-640-8040 secretary
ISRAEL | email: aa at math.tau.ac.il
| http://www.math.tau.ac.il/~aa/
----------------------------------------------------------------
More information about the FOM
mailing list