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 Classification
Statement Form Connections
Has Statement Form
In Branch
Source Gabbay's separation theorem - Wikipedia
Proved By
Source Gabbay's separation theorem - Wikipedia
Sources
1. Gabbay's separation theorem - Wikipedia
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.
In Branch: Logic and Foundations, Lead sentence
In mathematical logic and computer science, Gabbay's separation theorem states that any formula in linear temporal logic (LTL) wit
Proved By: Dov Gabbay, Lead sentence, attribution
stated and proven by Dov Gabbay
In Group: Mathematical Logic and Model Theory, Lead section
In mathematical logic and computer science, Gabbay's separation theorem
View the SourceReader 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.