Structural contradictions

Cindy Eisner, Dana Fisman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


We study the relation between logical contradictions such as p Λ ¬p and structural contradictions such as p ∩ (p q). Intuitively, we expect the two to be treated similarly, but they are not by PSL, nor by SVA. We provide a solution that treats both kinds of contradictions in a consistent manner. The solution reveals that not all structural contradictions are created equal: we must distinguish between them in order to preserve important characteristics of the logic. A happy result of our solution is that it provides the semantics over the natural alphabet 2 P , as opposed to the current semantics of PSL/SVA that use an inflated alphabet including the cryptic letters ⊤ and ⊥. We show that the complexity of model checking PSL/SVA is not affected by our proposed semantics.

Original languageEnglish
Title of host publicationHardware and Software
Subtitle of host publicationVerification and Testing - 4th International Haifa Verification Conference, HVC 2008, Proceedings
Number of pages15
StatePublished - 17 Jul 2009
Externally publishedYes
Event4th International Haifa Verification Conference, HVC 2008 - Haifa, Israel
Duration: 27 Oct 200830 Oct 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5394 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Haifa Verification Conference, HVC 2008

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Structural contradictions'. Together they form a unique fingerprint.

Cite this