# Intuitionistic Linear Temporal Logics

arXiv: https://arxiv.org/abs/1912.12893 · HTML: https://mlsanity.com/paper/1912.12893/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 30 Dec 2019.

## Built on by (most cited first, 3 of 3)

- [G"odel-Dummett linear temporal logic](https://mlsanity.com/paper/2306.15805/) (2023)
- [Reasoning about Intuitionistic Computation Tree Logic](https://mlsanity.com/paper/2310.02355/) (2023)
- [Applications of Intuitionistic Temporal Logic to Temporal Answer Set Programming](https://mlsanity.com/paper/2603.14692/) (2026)

## Abstract (arXiv)

We consider intuitionistic variants of linear temporal logic with `next', `until' and `release' based on expanding posets: partial orders equipped with an order-preserving transition function. This class of structures gives rise to a logic which we denote iltl, and by imposing additional constraints we obtain the logics itlb of persistent posets and itlht of here-and-there temporal logic, both of which have been considered in the literature. We prove that iltl has the effective finite model property and hence is decidable, while itlb does not have the finite model property. We also introduce notions of bounded bisimulations for these logics and use them to show that the `until' and `release' operators are not definable in terms of each other, even over the class of persistent posets.