Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets

DOI10.1016/0304-3975(92)90325-AzbMath0749.08005WikidataQ127391240 ScholiaQ127391240MaRDI QIDQ1185017

Vincenzo Manca, Antonino Salibra

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

probabilityprovabilitymany-sorted algebrasmany- sorted algebrasmany-sorted equational logicpartial valuationsstrong satisfiability

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Equational logic, Mal'tsev conditions (08B05)

Related Items

Free objects and equational deduction for partial conditional specifications, Reflection-closed varieties of multisorted algebras and minor identities

Cites Work

• First-order theories as many-sorted algebras
• Completeness of Proof Systems for Equational Specifications
• Heterogeneous algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item