Gabbay's separation theorem
From Infogalactic: the planetary knowledge core
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.[1] This form can be used as execution rules; a MetateM program is a set of such rules.[2]
References
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This mathematical logic-related article is a stub. You can help Wikipedia by expanding it. |
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This computer science article is a stub. You can help Wikipedia by expanding it. |
