Relations With Other Logics
LTL can be shown to be equivalent to the monadic first-order logic of order, FO—a result known as Kamp's theorem— or equivalently star-free languages.
Computation tree logic (CTL) and Linear temporal logic (LTL) are both a subset of CTL*. CTL and LTL are not equivalent and they have a common subset, which is a proper subset of both CTL and LTL. For example,
- No formula in CTL can define the language that is defined by the LTL formula F(G p).
- No formula in LTL can define the language that is defined by the CTL formula AG( p → (EXq ∧ EX¬q) ).
Read more about this topic: Linear Temporal Logic
Famous quotes containing the words relations with, relations and/or logics:
“Society does not consist of individuals but expresses the sum of interrelations, the relations within which these individuals stand.”
—Karl Marx (1818–1883)
“I know all those people. I have friendly, social, and criminal relations with the whole lot of them.”
—Mark Twain [Samuel Langhorne Clemens] (1835–1910)
“When logics die,
The secret of the soil grows through the eye,
And blood jumps in the sun;
Above the waste allotments the dawn halts.”
—Dylan Thomas (1914–1953)