Relative Completeness

  • Zhou Chaochen
  • Michael R. Hansen
Part of the Monographs in Theoretical Computer Science An EATCS Series book series (EATCS)


In this chapter, we consider the question of whether there is a proof for every valid formula of DC, i.e. whether the proof system of DC is complete. When using DC formulas in specifications, we want ∫S to be the integral of a Boolean-valued function. Therefore, to show the completeness of DC, it must be shown that the axioms DCA1 — DCA6, together with the rules IR1 and IR2 and the axioms and rules of IL, are enough to ensure that temporal variables of the form ∫S are definable by integrals.


Closed Interval Open Interval Proof System Relative Completeness Finite Partition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Zhou Chaochen
    • 1
  • Michael R. Hansen
    • 2
  1. 1.Institute of SoftwareChinese Academy of SciencesBeijingChina
  2. 2.Informatics and Mathematical ModellingTechnical University DenmarkLyngbyDenmark

Personalised recommendations