Re: Sorry Godel - All Truths are Provable

Charlie-Boo says...

Let w be any true sentence and v be any provable sentence. Now |-v
since v is provable, and |-(w^v) since w^v is logically equivalent to v
since w is true.

Two statements A and B are *logically* equivalent only if the statement

A <-> B

is provable. So w^v is not logically equivalent to v unless

w^v <-> v

is provable.

--
Daryl McCullough
Ithaca, NY

.

Relevant Pages

  • Re: Sorry Godel - All Truths are Provable
    ... Charlie-Boo wrote: ... (=true sentence, ... Now logically equivalent could mean provable equivalent ... logical) reasoning, your statement is not valid, ...
    (sci.logic)
  • Re: Sorry Godel - All Truths are Provable
    ... Charlie-Boo wrote: ... Let w be any true sentence and v be any provable sentence. ... So w^v is not logically equivalent to v unless ... then they obviously would have the same provability. ...
    (sci.logic)
  • Re: Sorry Godel - All Truths are Provable
    ... Daryl McCullough wrote: ... Let w be any true sentence and v be any provable sentence. ... So w^v is not logically equivalent to v unless ... then they obviously would have the same provability. ...
    (sci.logic)
  • Re: Sorry Godel - All Truths are Provable
    ... Charlie-Boo wrote: ... Let w be any true sentence and v be any provable sentence. ... So w^v is not logically equivalent to v unless ... then they obviously would have the same provability. ...
    (sci.logic)
  • Re: Sorry Godel - All Truths are Provable
    ... On Wed, 1 Mar 2006, Charlie-Boo wrote: ... you're a not a genius. ... More ticklish results soon to follow. ...
    (sci.logic)
Loading