Gabbay's separation theorem
In mathematical logic and computer science, Gabbay's separation theorem, named after Dov Gabbay, states that any arbitrary temporal logic formula can be rewritten in a logically equivalent "past → future" form. I.e. the future becomes what must be satisfied. This form can be used as execution rules; a MetateM program is a set of such rules.
Gabbay's separation theorem
In mathematical logic and computer science, Gabbay's separation theorem, named after Dov Gabbay, states that any arbitrary temporal logic formula can be rewritten in a logically equivalent "past → future" form. I.e. the future becomes what must be satisfied. This form can be used as execution rules; a MetateM program is a set of such rules.
has abstract
In mathematical logic and comp ...... rogram is a set of such rules.
@en
Wikipage page ID
19,835,615
Wikipage revision ID
744,421,720
comment
In mathematical logic and comp ...... rogram is a set of such rules.
@en
label
Gabbay's separation theorem
@en