de.mpg.escidoc.pubman.appbase.FacesBean
English

# Item

ITEM ACTIONSEXPORT

Released

Report

#### Proving a conjecture of Andreka on temporal logic

##### MPS-Authors
There are no MPG-Authors available
##### Locator
There are no locators available
##### Fulltext (public)

1999-3-004
(Any fulltext), 10KB

##### Supplementary Material (public)
There is no public supplementary material available
##### Citation

Raskin, J.-F.(1999). Proving a conjecture of Andreka on temporal logic (MPI-I-1999-3-004). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-6F41-8
##### Abstract
In \cite{Andreka}, a large number of completeness results about variants of discrete linear-time temporal logic are obtained. One of them is left as an open problem: the completeness of the logic of initially and next, for which a deductive system is proposed. This simple logic is of practical importance, since the proof of program invariants only require these modalities. We show here that the conjectured {\em medium completeness} of this system indeed holds; further, we show that deciding this entailment is PSPACE-complete, while deciding validity is only coNP-complete.