Computation tree logics and temporal logics with reference pointers

Journal of Applied Non-Classical Logics 10 (3-4):221-242 (2000)
Download Edit this record How to cite View on PhilPapers
A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium for reasoning about branching time.
PhilPapers/Archive ID
Upload history
Archival date: 2019-04-28
View other versions
Added to PP index

Total views
72 ( #57,313 of 70,032 )

Recent downloads (6 months)
7 ( #63,396 of 70,032 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.