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:
“She has problems with separation; he has trouble with unity—problems that make themselves felt in our relationships with our children just as they do in our relations with each other. She pulls for connection; he pushes for separateness. She tends to feel shut out; he tends to feel overwhelmed and intruded upon. It’s one of the reasons why she turns so eagerly to children—especially when they’re very young.”
—Lillian Breslow Rubin (20th century)
“The interest in life does not lie in what people do, nor even in their relations to each other, but largely in the power to communicate with a third party, antagonistic, enigmatic, yet perhaps persuadable, which one may call life in general.”
—Virginia Woolf (1882–1941)
“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)