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


510 users

0 votes

Hello all,

I cannot understand the last step. I can get to !EF!EFa. Could someone help, please.

This is from Question paper 2020.02.19, Ques 8a.


in * TF "Intelligent Systems" by (350 points)

1 Answer

+1 vote
Best answer
The negation of EF phi is AG ¬phi. (In words: “Not all paths have a point at which something holds” is the same as “There is a path where at every points the opposite of something holds)

Thus we get AG ¬¬EF a. The double negation cancels itself out. We are left with AGEF a.
by (25.6k points)
selected by
perfect..thank you.

Related questions

0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
0 votes
1 answer
Imprint | Privacy Policy