Gabbay's separation theorem
In mathematical logic and computer science, Gabbay's separation theorem states that any formula in linear temporal logic (LTL) with past operators can be rewritten as a boolean combination of formulas that are only concerned with the past, present, or future. This theorem was stated and proven by Dov Gabbay.