Quantifier-free logic for multialgebraic theories

DOI10.1016/S1571-0661(04)80851-XzbMath1264.03086MaRDI QIDQ4924535

Michał Walicki, Yngve Lamo

Publication date: 6 June 2013

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reasoning with first order nondeterministic specifications
• Rasiowa-Sikorski deduction systems in computer science applications.
• Specialization of the use of axioms for deduction search in axiomatic theories with equality
• Institutions: abstract model theory for specification and programming
• Generated models and the ω-rule: The nondeterministic case
• Decomposition proof systems for Gödel-Dummett logics

This page was built for publication: Quantifier-free logic for multialgebraic theories