On Tuesday, December 4, 2018 at 4:50:22 PM UTC-6, Brent wrote:
>
>
>
> On 12/4/2018 11:50 AM, Philip Thrift wrote:
>
>
>
> On Tuesday, December 4, 2018 at 1:46:44 PM UTC-6, Brent wrote:
>>
>>
>>
>> On 12/4/2018 12:06 AM, Philip Thrift wrote:
>>
>> Can you give an example of "truth in the programming" and how it differs
>>> from the mathematical idea of true and the correspondence theory of truth?
>>>
>>> Brent
>>>
>>
>>
>>
>> Truth in programming follows the Brouwerian concept of truth:
>> [ https://plato.stanford.edu/entries/brouwer/ ]
>>
>>
>>
>> *There is no determinant of mathematical truth outside the activity of
>> thinking; a proposition only becomes true when the subject has experienced
>> its truth (by having carried out an appropriate mental construction);
>> similarly, a proposition only becomes false when the subject has
>> experienced its falsehood (by realizing that an appropriate mental
>> construction is not possible).*
>>
>> *There is no determinant of mathematical truth outside the activity of
>> computing;* a proposition only becomes true when the program has
>> produced its truth (by having carried out an appropriate computational
>> construction); similarly, a proposition only becomes false when the program
>> has produced its falsehood (by computing that an appropriate computational
>> construction is not possible).
>>
>>
>> I didn't ask for examples of circular definitions.
>>
>> Brent
>>
>
>
>
> In what sense is type theory circular logic?
>
>
> First, I didn't ask for a logic, I asked for examples to the different
> ideas of truth. Instead you provided some assertions about "where truth is
> determined" and about becoming true...which were circular.
>
> "a proposition only becomes* true* when the subject has experienced its
> *truth*"
>
> " a proposition only becomes *true* when the program has produced its
> *truth*"
>
> Third, neither your post nor the article on Brouwer said anything about
> type theory.
> https://plato.stanford.edu/entries/type-theory-intuitionistic/
>
> Brent
>
The simple way to put it:
Write a *Lisp* program *p*.
If *p* returns nil, pi is false.
If *p *returns anything else, *p* is true.
That's all you need to know about truth.
- pt
--
You received this message because you are subscribed to the Google Groups
"Everything List" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/everything-list.
For more options, visit https://groups.google.com/d/optout.
