Rasiowa-Sikorski deduction systems in computer science applications

Theoretical Computer Science

Volumn 286, Issue 2, 2002, Pages 323-366

  Konikowska, Beata ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

Completeness; Concurrency; Decomposition rule; Decomposition tree; Deduction system; Many valued logic; Rasiowa Sikorski; Software specification logic

Indexed keywords

COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SCIENCE; CONCURRENCY CONTROL; FORMAL LOGIC; LOGIC PROGRAMMING; SEMANTICS; THEOREM PROVING; TREES (MATHEMATICS);

MANY-VALUED LOGICS; SOFTWARE SPECIFICATION LOGICS;

COMPUTER SOFTWARE;

EID: 0037125936     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00320-6     Document Type: Conference Paper

References (27)

1. A logic for non-deterministic specifications
2. Three-valued predicates for software specification and validation
3. A many sorted logic with possibly empty sorts
4. A multimodal logic for reasoning about complementarity
5. Logics of complementarity in information systems
6. A proof system for fork algebras and its applications to reasoning in logics based on intuitionism
7. Temporal Logic (ICTL'94)
8. Nondeterministic algebraic specifications and non-confluent term rewriting
9. Two over three: A two-valued logic for software specification and validation over a three-valued predicate calculus
10. A logic for reasoning about relative similarity
11. A logic for reasoning about similarity
12. Natural deduction systems for Rosser-Turquette many-valued logic
13. Rasiowa-Sikorski deduction system: A handy tool for computer science logic
14. Reasoning with first-order nondeterministic specifications
15. A relational formalisation of arbitrary finitely many valued logic (special issue)
16. A relational formalisation of a generic many-valued modal logic
17. A three-valued logic for software specification and validation
18. Relational proof system for linear and other substructural logics
19. Relational proof system for relevant logics
20. Relational proof systems for modal logics
21. A resolution calculus with dynamic sort structures and partial functions
22. A complete calculus for multialgebraic and functional semantics of nondeterminism
23. Unification in sort theories and its applications
24. The tableau method for temporal logic: An overview