Quantifier-free logic for nondeterministic theories

DOI10.1016/J.TCS.2006.01.010zbMath1088.68113OpenAlexW2046478788MaRDI QIDQ2369014

Michał Walicki, Yngve Lamo

Publication date: 28 April 2006

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.01.010

zbMATH Keywords

NondeterminismAlgebraic specificationStrong completenessMultialgebraRasiowa-Sikorski techniqueSpecific cut

Mathematics Subject Classification ID

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

Related Items (1)

A Term-Graph Syntax for Algebras over Multisets

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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