Rasiowa-sikorski deduction systems: A handy tool for computer science logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1589, Issue , 1999, Pages 183-197

  Konikowska, Beata ^a  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORESTRY; FORMAL LOGIC; RECONFIGURABLE HARDWARE; SPECIFICATIONS;

DECOMPOSITION TREES; DEDUCTION SYSTEMS; FIRST ORDER LOGIC; NEW RESULTS; NONDETERMINISTIC SPECIFICATION; SOFTWARE SPECIFICATION; TABLEAU SYSTEMS; THREE-VALUED;

COMPUTER CIRCUITS;

EID: 84957686353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48483-3_13     Document Type: Conference Paper

References (14)

1. Beth, E.W. The Foundations of Mathematics, North-Holland, 1959.
2. Bialasik, M., Konikowska, B. Reasoning with rst-order nondeterministic speci- cations, to appear in Acta Informatica.
3. Bialasik, M., Konikowska, B. A logic for non-deterministic specications, to appear in: E. Orlowska, ed., Logic at work: essays dedicated to the memory of H. Rasiowa, Kluwer, Holland.
4. Cohn, A.G. A many sorted logic with possibly empty sorts, in Proceedings CADE- 11, LNAI 607, pp 633-647, 1992.
5. Gabbay, D. Labelled deductive systems, Oxford University Press, Oxford 1991.
6. Hussmann, H. Nondeterministic algebraic specications and non-confluent term rewriting, Journal of Logic Programming 12, 1992, pp. 237-255.
7. Konikowska, B. A logic for reasoning about similarity, E. Orlowska, ed., Incomplete information: Rough Set Analysis, Physica-Verlag, New York 1997.
8. Konikowska, B. A logic for reasoning about relative similarity, in: H. Rasiowa, E. Orlowska, ed., of Studia Logica, Reasoning with incomplete information, No 1, 1997, pp. 185-226.
9. Konikowska, B. Two over three: a two-valued logic for software specication and validation over a three-valued predicate calculus, Journal for Applied Nonclassical Logic, Vol. 3 (1), 1993, pp. 39-71.
10. Ohlbach, H.J., Weidenbach, C. A resolution calculus with dynamic sort structures and partial functions, in Proceedings ECAI, ed. L.C. Aiello, Pitman, London 1990.
11. Orlowska, E. Relational proof systems for modal logics. In: H. Wansing (ed) Proof Theory of Modal Logics. Kluwer, Dordrecht, 55-77, 1996.
12. Rasiowa, H., Sikorski, R. The mathematics of metamathematics, Warsaw, PWN 1963.
13. Walicki, M., Meldal, S., A complete calculus for multialgebraic and functional semantics of nondeterminism, ACM TOPLAS, 17(2), 1995.
14. Weidenbach, C. Unication in sort theories and its applications, Annals of Mathematics and Articial Intelligence, vol. 18, pp. 261-293, 1996n.