Completeness of Proof Systems for Equational Specifications

D.B. MacQueen, D.T. Sannella

Research output: Contribution to journalArticlepeer-review

Abstract

Contrary to popular belief, equational logic with induction is not complete for initial models of equational specifications. Indeed, under some regimes (the Clear specification language and most other algebraic specification languages) no proof system exists which is complete even with respect to ground equations. A collection of known results is presented along with some new observations.

Original languageEnglish
Pages (from-to)454 - 461
JournalIEEE Transactions on Software Engineering
VolumeSE-11
Issue number5
DOIs
Publication statusPublished - 1 May 1985

Fingerprint

Dive into the research topics of 'Completeness of Proof Systems for Equational Specifications'. Together they form a unique fingerprint.

Cite this