Completeness of Proof Systems for Equational Specifications
- 1 May 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-11 (5) , 454-461
- https://doi.org/10.1109/tse.1985.232484
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.Keywords
This publication has 0 references indexed in Scilit: