[FOM] First Order Logic/status

[joeshipman@aol.com]

AX1 EX2 EX3 (X1+x2=X3 & AX4 AX5 ~(SSX4*SSX5=X3 V SS4*SS5=SSX3))

AX1 EX2 EX3 (SSX1+SSX1=X2+X3 & AX4 AX5 ~(SSX4*SSX5=X2 V SSX4*SSX5=X3))

context:

Friedman:
>> ***Under any reasonable measure of complexity of sentences in the 
language
>> of PA, any sentence or scheme in the language of PA of modest 
complexity is
>> either provable or refutable in PA.***
>
Davis:
> This assertion surprises me. I for one don't believe it, and see no 
compelling
> evidence for it considering the large number of such sentences that 
have
> remained unresolved despite great interest.
>
Friedman:
Not a single one of them is of reasonable complexity as sentences or 
schemes
in the primitive language of PA with 0,S,+,x.

-- JS
________________________________________________________________________
Check out the new AOL.  Most comprehensive set of free safety and 
security tools, free access to millions of high-quality videos from 
across the web, free AOL Mail and more.