Timeline for Game semantics for coinductive predicates
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 30, 2010 at 7:49 | vote | accept | Dave Clarke | ||
| Sep 30, 2010 at 7:49 | history | edited | Dave Clarke | CC BY-SA 2.5 |
Added helpful reference (so that I can accept this answer).
|
| Sep 29, 2010 at 12:20 | comment | added | Marc Hamann | As I alluded to in my parenthetical comment, I think you can insist that Falsifier selects the head of the stream. In that case you would probably want to let him choose k the number of turns they will play. Then Verifier's job is to show that for all k, she can always verify blackness. However, I'll look forward to your expanded example rather than bombard you with things you may already have thought of. ;-) | |
| Sep 29, 2010 at 8:11 | comment | added | Dave Clarke | Thanks again Marc. The problem I want to avoid is having the Falsifier able to jump into the middle of the stream to find the counter-example. They need to play the game out step by step. What I'm lacking is the winning condition. I now realise that my example is too small. I'll come up with a larger one soon. | |
| Sep 28, 2010 at 21:49 | history | edited | Marc Hamann | CC BY-SA 2.5 |
added 462 characters in body
|
| Sep 28, 2010 at 13:49 | history | edited | Marc Hamann | CC BY-SA 2.5 |
added 601 characters in body
|
| Sep 25, 2010 at 16:55 | comment | added | Dave Clarke | I meant to say "Marc". | |
| Sep 25, 2010 at 12:57 | comment | added | Dave Clarke | Thanks Mark. There's certainly some material in the book to help me. Well, more than some. | |
| Sep 24, 2010 at 15:31 | history | answered | Marc Hamann | CC BY-SA 2.5 |