Temporal Logics with Reference Pointers and Computation Tree Logics

Journal of Applied Non-Classical Logics 10 (3-4):221-242 (2000)
  Copy   BIBTEX

Abstract

ABSTRACT A complete axiomatic system CTLrp is introduced for a temporal logic for finitely branching ω+ -trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTLrp. 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.

Author's Profile

Valentin Goranko
Stockholm University

Analytics

Added to PP
2014-03-21

Downloads
215 (#62,719)

6 months
76 (#49,909)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?