On 21 Jun 2015, at 19:55, meekerdb wrote:
On 6/21/2015 8:16 AM, Bruno Marchal wrote:
Z is what the machine can say about the []p & <>t points of view
(like the bet that you will have coffee in the modified step 3
protocol).[]coffee means you get coffee in all consistent
extensions (which in this protocol are W and M), and <>t is the
explicit conditioning that there is at least one consistent
extension, which does not follow from []p due to incompleteness.
You can see that []p & <>t is a weakening of the []p & p move.
Incompleteness forces the machine to provides different logics for
those nuances.
I don't understand this use of "consistent". At first I thought it
meant logical consistency, i.e. not proving false.
That is what I mean.
But in the above you use it as though it meant something like
nomologically consistent.
I don't see why. I use the completeness theorem. A theory/machine is
consistent iff it admits a model.
To be consistent = having a "reality" satisfying or verifying the
beliefs.
Bruno
PS I will have to go. Some other posts could be commented tomorrow.
Brent
--
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 http://groups.google.com/group/everything-list.
For more options, visit https://groups.google.com/d/optout.
http://iridia.ulb.ac.be/~marchal/
--
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 http://groups.google.com/group/everything-list.
For more options, visit https://groups.google.com/d/optout.
