Completeness of category-based equational deduction

DOI10.1017/S0960129500000621zbMath0835.18003MaRDI QIDQ4847310

Răzvan Diaconescu

Publication date: 20 September 1995

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

equational logiccompleteness theorem

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Equational categories (18C05) Theories (e.g., algebraic theories), structure, and semantics (18C10) Equational classes, universal algebra in model theory (03C05) Categories of algebras (08C05)

Related Items

Category-based modularisation for equational logic programming, Herbrand theorems in arbitrary institutions, An introduction to category-based equational logic, Logical foundations of CafeOBJ

Cites Work

• Unnamed Item
• Semantics of computation
• Initial Algebra Semantics and Continuous Algebras
• Institutions: abstract model theory for specification and programming
• Identities in Categories