Mathematical logic and foundations Concept
Linear temporal logic
Summary
Linear temporal logic (LTL) is a modal logic whose formulas speak about a single infinite sequence of time steps. Besides the Boolean connectives it has the operators "next" () and "until" (), and from them "eventually" () and "always" (). It is a standard language for properties of reactive systems, such as "every request is eventually granted". It is a main input language of model checking.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | RMJ56ZPA63 |
|---|---|
| URI | m2://RMJ56ZPA63 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03B44, 68Q60, 03B70 |
| Specializes | Modal logic |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.