Abstract

Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantifier projectivity, using a semantic treatment that regards quantifiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted [conditional] equational logics, Horn clause logic, equational deduction modulo a theory, constraint logics, and more, as well as any possible combination among them. In the cases of equational deduction modulo a theory and of constraint logic the completeness result is new. One important consequence is an abstract version of Herbrand's Theorem, which provides an abstract model theoretic foundations for equational and constraint logic programming. 1 Introduction A uniform treatment of the model theory of classical equational logic is now possible due to the comprehensive development of categorical universal algebra; without any c...

Citations

176	Heterogeneous logic - Barwise, Etchemendy - 1995
164	Toposes, Triples and Theories - Barr, Wells - 1985
156	On the structure of abstract algebras - Birkhoff - 1935
69	Graph expressions and graph rewriting - Bauderon, Courcelle - 1987
42	Axioms for abstract model theory - Barwise - 1974
24	Structures Algébriques dans les Catégories, Cahiers de Topologie et Géometrie Differéntielle - Bénabou - 1968
24	Category-based semantics for equational and constraint logic programming - Diaconescu - 1994
19	Semantics of computation - Goguen - 1974
18	Hiding and behaviour: an institutional approach - Burstall, Diaconescu - 1992
17	The logic of Horn clauses is equational - Diaconescu - 1993
9	Local equational logic - Cazanescu - 1993
7	Computing with rewrite rules - Dershowitz - 1983