Axiomatizability in inclusive equational logics

作者: GRIGORE ROŞU

DOI: 10.1017/S0960129501003474

关键词:

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

参考文章(14)
Grigore Rosu, Virgil Emil Cazanescu, Weak Inclusion Systems: Part Two Journal of Universal Computer Science. ,vol. 6, pp. 5- 21 ,(2000)
Barry Mitchell, Theory of categories Academic Press. ,(1965)
Joseph A. Goguen, Răzvan Diaconescu, An Introduction to Category-based Equational Logic algebraic methodology and software technology. pp. 91- 126 ,(1995) , 10.1007/3-540-60043-4_48
Răzvan Diaconescu, A Category-Based Equational Logic Semantics to Constraint Programming workshop on specification of abstract data types joint with compass workshop on recent trends in data type specification. pp. 200- 221 ,(1995) , 10.1007/3-540-61629-2_44
I. Németi, On notions of factorization systems and their applications to cone-injective subcategories Periodica Mathematica Hungarica. ,vol. 13, pp. 229- 235 ,(1982) , 10.1007/BF01847919
Joseph A. Goguen, Rod M. Burstall, Institutions: abstract model theory for specification and programming Journal of the ACM. ,vol. 39, pp. 95- 146 ,(1992) , 10.1145/147508.147524
Garrett Birkhoff, On the Structure of Abstract Algebras Mathematical Proceedings of the Cambridge Philosophical Society. ,vol. 31, pp. 433- 454 ,(1935) , 10.1017/S0305004100013463
Grigore Roşu, Equational axiomatizability for coalgebra Theoretical Computer Science. ,vol. 260, pp. 229- 247 ,(2001) , 10.1016/S0304-3975(00)00129-8
J.A. Goguen, R.M. Burstall, Some fundamental algebraic tools for the semantics of computation: Part 2: Signed and abstract theories Theoretical Computer Science. ,vol. 31, pp. 263- 295 ,(1984) , 10.1016/0304-3975(84)90036-7