10 November 2000, Computational Logic Seminar

10 November 2000, Computational Logic Seminar
Speaker: Ewa Orlowska (Polish Academy of Science)
Title: Relational Proof Theory
Date and Time: November 10, 2000, 15.00-16.00
Location: Euclides Building, Plantage Muidergracht 24, Amsterdam, room P.327
Note: this talk was cancelled

Abstract:
In 1960 Helena Rasiowa and Roman Sikorski proved completeness of the classical predicate logic using a cut-free proof system of the tableau-style. We discuss a methodology of Rasiowa-Sikorski proof theory. We present general correspondence results that lead to the principles of generation of the rules from constraints. We present proof systems for various algebraic structures and non-classical logics, in particular for structures used in spatial reasoning, for substructural logics and for information systems.

For more information, see http://www.illc.uva.nl/~mdr/ACLG/Local/seminar00-2.html.