Nonclassical Logics in Computer Science (WiSe 2015/16)

Lecturers Tadeusz Litak, Lutz Schröder
Dates Mo, 14:15 – 15:45, Di, 16:15 – 17:45, 01.255-128
Target Audience WPF INF-MA 8 (ECTS-Credits: 7,5)
WPF INF-BA-V-THI (ECTS-Credits: 7,5)

(Suitable as elective course (WPF) for computer science minors from various departments, including mathematics.)

Course Description

Sheets

  • Sheet 2 Update 2: after the lecture Nov 17. Update 1: after the lecture Nov 10 (18:55)
  • Sheet 3 Update 2: clarification in the second clause of Ex 5 (Dec 11). Update 1: after the lecture Nov 30
  • Sheet 4, edited Deadline postponed to Jan 19, last edit on Fri Jan 15 afternoon. Here is the original formulation of G3c mentioned in the Blatt. It should be sufficiently clearly described in the text anyway.

Additional material

Literature

  • Patrick Blackburn, Maarten de Rijke, Yde Venema. Modal Logic. Cambridge Tracts in Theoretical Computer Science. 2002
  • Alexander Chagrov, Michael Zakharyaschev. Modal Logic. Oxford University Press 1997
  • David Pym. The Semantics and Proof Theory of the Logic of Bunched Implications. Kluwer Academic Publishers, 2002.
  • Greg Restall. An Introduction to Substructural Logics, Routledge 2000
  • Nick Galatos, Peter Jipsen, Tomasz Kowalski, Hiroakira Ono. Residuated Lattices: An Algebraic Glimpse at Substructural Logics. Elsevier 2007
  • Anne S. Troelstra, Helmut Schwichtenberg, Basic Proof Theory, Cambridge Tracts in Theoretical Computer Science
  • Anne S. Troelstra, Lectures on Linear Logic, CSLI Publications 1992