Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.2k answers


531 users

0 votes

In the result of first question,  a holds infinitely often so how F!a holds and satisfies S1?  

in * TF "Emb. Sys. and Rob." by (440 points)

1 Answer

0 votes
Well, also !a holds infinitely, often and GF phi implies F phi, so F!a is always true on the path of the structure.
by (166k points)
Imprint | Privacy Policy