Rasiowa-Sikorski deduction systems in computer science applications.

DOI10.1016/S0304-3975(01)00320-6zbMath1058.03029MaRDI QIDQ1853457

Beata Konikowska

Publication date: 21 January 2003

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

zbMATH Keywords

CompletenessConcurrencyMany-valued logicDecomposition ruleDecomposition treeRasiowa-Sikorski deduction systemSoftware specification logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Structure of proofs (03F07) Abstract deductive systems (03B22)

Related Items

Quantifier-free logic for nondeterministic theories, Relational dual tableau decision procedures and their applications to modal and intuitionistic logics, Rasiowa-Sikorski deduction systems with the rule of cut: a case study, Implementing a relational theorem prover for modal logic, Hypersequent and display calculi -- a unified perspective, Quantifier-free logic for multialgebraic theories, Tableaux and dual tableaux: transformation of proofs, The method of Socratic proofs for modal propositional logics: K5, S4.2, S4.3, S4F, S4R, S4M and G., Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism, Dual tableau for a multimodal logic for order of magnitude qualitative reasoning with bidirectional negligibility, An implementation of a dual tableaux system for order-of-magnitude qualitative reasoning, A new methodology for developing deduction methods

Cites Work

• A logic for reasoning about relative similarity
• Temporal logic. 1st International Conference, ICTL '94, Bonn, Germany, July 11-14, 1994. Proceedings
• Unification in sort theories and its applications
• Reasoning with first order nondeterministic specifications
• Mathematical thought. An introduction to the philosophy of mathematics
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• Relational proof system for relevant logics
• A relational formalisation of arbitrary finite valued logics
• Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
• Relational proof system for linear and other substructural logics
• A multimodal logic for reasoning about complementarity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item