Re: [tlaplus] Question about a TLA derivation

[Stephan Merz <stephan.merz@xxxxxxxxx>]

As written in the text, the chain of equivalences shows that

(1) <>[]<>F <=> []<>F

implies the equivalence

(2) []<>[]F <=> <>[]F.

The validity of equivalence (1) – which is the step that you are having trouble with – is argued informally, but you can justify it formally using the semantic definitions of [] and <>. Alternatively, use a PTL tautology checker.

Cheers,

Stephan

On 15 Nov 2024, at 16:52, Andrew Helwer <andrew.helwer@xxxxxxxxx> wrote:

On page 68 of A Science of Concurrent Programs we have the following derivation:

□◇□F ≡ ¬◇¬¬□¬¬◇¬F ≡ ¬◇□◇¬F ≡ ¬□◇¬F ≡ ¬¬◇¬¬□¬¬F ≡ ◇□F

I am having trouble understanding this step in particular:

¬◇□◇¬F ≡ ¬□◇¬F

How is this step done? I remember getting stuck on this exact transformation the last time this was discussed a few months ago. Thanks!

Andrew Helwer

--
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx.
To view this discussion visit https://groups.google.com/d/msgid/tlaplus/a9993fd7-d65b-4267-a073-c3b448d3eb15n%40googlegroups.com.

--
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx.
To view this discussion visit https://groups.google.com/d/msgid/tlaplus/CA83FD0F-8B1B-4C69-B6B9-86329B232C63%40gmail.com.