Re: Fitch's paradox and OWA
Date: Thu, 31 Dec 2009 15:58:41 -0800 (PST)
Message-ID: <17e8ec70-caf8-4177-8e04-da413070d540_at_e27g2000yqd.googlegroups.com>
On Dec 31, 3:40 pm, Nam Nguyen <namducngu..._at_shaw.ca> wrote:
> Barb Knox wrote:
>
> > They are true or false in any *particular* model. Since we apparently
> > cannot formally pin down arithmetic to have just one particular model
> > (the Standard one) then there will always be some arithmetic statements,
> > the undecidable ones, which are true in some models and false in others.
>
> Agree. The question - and the heart of my argument - is whether or not there
> exists a formula F such that it's impossible to know/assert a truth value
> in the collection K of _all_ arithmetic models: K = {the standard one, the
> non-standard ones}? I've argued that there exist such statements.
Why would the existence of such statements imply that there are truth values other than true or false?
Marshall Received on Fri Jan 01 2010 - 00:58:41 CET