Complete Categorical Equational Deduction

Authors:
Grigore Rosu
Affiliations:
-
Venue:
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Year:
2001

Citing 7
Cited 0

Initial computability, algebraic specifications, and partial algebras

Initial computability, algebraic specifications, and partial algebras
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Theoretical Computer Science
A hidden agenda

Theoretical Computer Science
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Local Equational Logic

FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Circular Coinductive Rewriting

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Completeness of many-sorted equational logic

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

A categorical four-rule deduction system for equational logics is presented. We show that under reasonable finiteness requirements this system is complete with respect to equational satisfaction abstracted as injectivity. The generality of the presented framework allows one to derive conditional equations as well at no extra cost. In fact, our deduction system is also complete for conditional equations, a new result at the author's knowledge.