Quantifier-free logic for nondeterministic theories

DOI10.1016/J.TCS.2006.01.010MaRDI QIDQ2369014zbMATH OpenOpenAlexFDO

Authors Yngve Lamo, Michał Walicki

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)

Recommendations

• Quantifier-free logic for multialgebraic theories
• scientific article; zbMATH DE number 1303442
• Reasoning with first order nondeterministic specifications
• Combining specification formalisms in the `general logic' of multialgebras.
• scientific article; zbMATH DE number 234027

Cites work

• scientific article; zbMATH DE number 1303442 (Why is no real title available?)
• scientific article; zbMATH DE number 1418370 (Why is no real title available?)
• scientific article; zbMATH DE number 234027 (Why is no real title available?)
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)
• Institutions: abstract model theory for specification and programming
• Rasiowa-Sikorski deduction systems in computer science applications.
• Reasoning with first order nondeterministic specifications
• Specialization of the use of axioms for deduction search in axiomatic theories with equality

Cited in

(11)

• scientific article; zbMATH DE number 1354147 (Why is no real title available?)
• Independence-friendly logic without Henkin quantification
• Combining specification formalisms in the `general logic' of multialgebras.
• A Term-Graph Syntax for Algebras over Multisets
• Quantifier-free versions of first order logic and their psychological significance
• Non-deterministic semantics for logics with a consistency operator
• A constructive semantics for non‐deducibility
• Quantifier-free logic for multialgebraic theories
• A reasoning system for satisfiability of diagrammatic specifications
• Neutral free logic: motivation, proof theory and models
• Non deterministic classical logic: the $\lambda\mu^{++}$-calculus

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369014)