Re: ?? truth as provability ??

"galathaea" <galathaea@xxxxxxxxx> writes:

>> ** Can you specify one particular theorem which you interpret as being
>> close to stating that an arithmetical sentence is intuitionistically
>> true if and only if it has a proof in S, for some formal system S? **
>>
>>
>>
>> theorem 9.9

Theorem 9.9 is a characterization of the formulas provable in
intuitionistic propositional logic. It doesn't even have the
appearance of saying anything about arithmetical truth.

.

Quantcast