Gabbay's separation theorem, in mathematical logic and computer science, states that any formula of linear temporal logic that includes past-tense operators can be rewritten as a Boolean combination of formulas that each refer only to the past, only to the present, or only to the future. The theorem was stated and proved by the logician Dov Gabbay.
Facts
Statementany 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 1 Sources
1. Gabbay's separation theorem - Wikipedia
IntroductionQuote, Introduction
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.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.