A hierarchical completeness proof for propositional temporal logic

De Montfort University Open Research Archive

Show simple item record

dc.contributor.author Moszkowski, B. C. en
dc.date.accessioned 2008-11-24T13:57:18Z
dc.date.available 2008-11-24T13:57:18Z
dc.date.issued 2004-02-24 en
dc.identifier.citation Moszkowski, B.C.(2004) A hierarchical completeness proof for propositional temporal logic. Springer Verlag, 2772, pp. 480-523.
dc.identifier.issn 0302-9743 en
dc.identifier.uri http://hdl.handle.net/2086/255
dc.description This paper introduces novel analysis of conventional propositional linear-time temporal logic (PTL). Two key features of the method are that it is hierarchical and an interval-oriented generalization of PTL called PITL serves as a kind of meta-notation. The presentation concerns axiomatic completeness for PTL but is further developed in Outputs 3 and 4 to consider numerous issues. Consequently, the significance and impact from those papers (including a BCS-FACS seminar and a Belgian national seminar) also reflects on this one which initiated the approach. en
dc.language.iso en en
dc.publisher Springer Verlag en
dc.subject RAE 2008
dc.subject UoA 23 Computer Science and Informatics
dc.title A hierarchical completeness proof for propositional temporal logic en
dc.type Article en
dc.identifier.doi http://dx.doi.org/10.1007/b12001 en
dc.researchgroup Software Technology Research Laboratory (STRL)


Files in this item

This item appears in the following Collection(s)

Show simple item record