The Internet Archive has a preservation copy of this work in our general collections.
The file type is
We present a hierarchical framework for analysing propositional linear-time temporal logic (PTL) to obtain standard results such as a small model property, decision procedures and axiomatic completeness. Both finite time and infinite time are considered and one consequent benefit of the framework is the ability to systematically reduce infinite-time reasoning to finite-time reasoning. The treatment of PTL with both the operator Until and past time naturally reduces to that for PTL withoutarXiv:cs/0601008v2 fatcat:gdpsuxxhk5bfjobq3qcsicawye