Axiomatizability in Inclusive Equational Logics

A categorical framework for equational logics is presented, together with axiomatizability results in the style of Birkhoff. The distinctive categorical structures used are inclusion systems, which are an alternative to factorization systems in which factorization is required to be unique rather than unique ‘up to an isomorphism’. In this framework, models are any objects, and equations are special epimorphisms in C, while satisfaction is injectivity. A first result says that equations-as-epimorphisms define exactly the quasi-varieties, suggesting that epimorphisms actually represent conditional equations. In fact, it is shown that the projectivitysfreeness of the domain of epimorphisms is what makes the difference between unconditional and conditional equations, the first defining the varieties, as expected. An abstract version of the axiom of choice seems to be sufficient for free objects to be projective, in which case the definitional power of equations of projective and free domain, respectively, is the same. Connections with other abstract formulations of equational logics are investigated, together with an organization of our logic as an institution.

[1]  Razvan Diaconescu,et al.  A Category-Based Equational Logic Semantics to Constraint Programming , 1995, COMPASS/ADT.

[2]  Joseph A. Goguen,et al.  Order Sorted Algebra , 1996 .

[3]  Grigore Rosu Equational axiomatizability for coalgebra , 2001, Theor. Comput. Sci..

[4]  Razvan Diaconescu,et al.  Completeness of category-based equational deduction , 1995, Mathematical Structures in Computer Science.

[5]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[6]  B. Mitchell,et al.  Theory of categories , 1965 .

[7]  S. Lane Categories for the Working Mathematician , 1971 .

[8]  Joseph A. Goguen,et al.  An Introduction to Category-based Equational Logic , 1995, AMAST.

[9]  Virgil Emil Cazanescu,et al.  Weak Inclusion Systems: Part Two , 2000, J. Univers. Comput. Sci..

[10]  Virgil Emil Cazanescu,et al.  Weak Inclusion Systems , 1997, Math. Struct. Comput. Sci..

[11]  Joseph A. Goguen,et al.  Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories , 1984, Theor. Comput. Sci..

[12]  Joseph A. Goguen,et al.  Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories , 1984, Theor. Comput. Sci..

[13]  Virgil Emil Cazanescu Local Equational Logic , 1993, FCT.

[14]  Joseph A. Goguen,et al.  Institutions: abstract model theory for specification and programming , 1992, JACM.

[15]  I. Németi On notions of factorization systems and their applications to cone-injective subcategories , 1982 .