This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Completeness of Proof Systems for Equational Specifications
May 1985 (vol. 11 no. 5)
pp. 454-461
D.B. MacQueen, AT&T Bell Laboratories
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.
Index Terms:
proof systems, Algebraic specifications, equational logic
Citation:
D.B. MacQueen, D.T. Sannella, "Completeness of Proof Systems for Equational Specifications," IEEE Transactions on Software Engineering, vol. 11, no. 5, pp. 454-461, May 1985, doi:10.1109/TSE.1985.232484
Usage of this product signifies your acceptance of the Terms of Use.