Rasiowa-Sikorski Deduction Systems: A Handy Tool for Computer Science Logics

Authors:
Beata Konikowska
Affiliations:
-
Venue:
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Year:
1998

Citing 4
Cited 1

Nondeterministic algebraic specifications and nonconfluent term rewriting

Journal of Logic Programming
A complete calculus for the multialgebraic and functional semantics of nondeterminism

ACM Transactions on Programming Languages and Systems (TOPLAS)
Relational proof systems for some AI logics

FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
A Many Sorted Logic with Possibly Empty Sorts

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction

Quantifier-free logic for nondeterministic theories

Theoretical Computer Science - Logic, language, information and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Rasiowa-Sikorski system is a sequence-type formalization of logics based on building decomposition trees of formulae labelled with sequences of formulae. Proofs are finite decomposition trees with leaves having "fundamental", valid labels. The system is dual to the tableau system. The author gives examples of applying the R-S formalism to various C.S and A.I. logic, including a logic for reasoning about relative similarity, a three-valued software specification logic with McCarthy's connectives, and a logic for nondeterministic specifications. As a new result, an R-S system for many-sorted first order logic with possibly empty carriers of some sorts is developed.