[ Lehrveranstaltungen 185/2 ]
[ AG Theoretische Informatik und Logik ]
[ Fachbereich Informatik ]
[ Technische Universität Wien ]
2.0 VU Nichtklassische Logiken (185.249, WS 2015/16)
(Nonclassical logics)
Lecturer:
Chris Fermüller.
This course will be held in English.
Contents:
The last (8th) meeting
takes place
Friday, January 15, 2016,
11:00  13:00
Seminar Room von Neumann
Favoritenstraße 9 / ground floor
Submit requests/suggestions for topics to be discussed at the last meeting to
Chris Fermüller
 Please submit your solutions till Wednesday night
before the next meeting
(see above) in PDF to Chris Fermüller.
Reminder: Please mention "NCL exercises" in the subject line!
 short reminder on the main concepts
of classical first order logic
 informal classification and
overview over the vast area
of 'nonclassical logics' for orientation
 In the main part of the course we plan to cover the
following areas and topics:
 Modal logics (this will be our main topic):
 What are modal logics? What are they used for?
 Introduction into the general theory of modal logics:
syntax, (Kripke style) semantics,
proof systems, expressibility, 'correspondence theory',
relations between important modal logics, multimodal logics, ...
 Epistemic logic(s) (for modelling multiagent systems)
 Hints at other families of modal logics:
temporal logic, deontic logic, dynamic logic, provability logic, ...
 Constructive logic (intuitionistic logic):
 general motivation
 different semantics: Kripke/Beth style semantics,
BrouwerHeytingKolmogorov interpretation, topological semantics
 different proof systems: Hilbert type, sequent system(s),
'natural deduction', ...
 dialogue games characterizing constuctive (and other) logics
 Selected topics on other types of logics, e.g.,:
 many valued logics, fuzzy logics
 game semantics, dialogue games
 modal epistemic logic
Basic knowledge about classical propositional and firstorder logic
as covered, e.g., in "Theoretische Informatik und Logik".
TEST YOURSELF whether you are fit for this course:
You should be able to prove without handwaving (and
preferably without consulting any book or notes)
that (forall x) (exists y) P(x,y) is a logical consequence of
(exists x) (forall y) P(y,x), and to (rigorously) show that
the converse does not hold.
In particular you should be able to present a formal definition
of the (logical) consequence relation and of a (formal)
model/interpretation of a classical firstorder formula.
The course will take place in slightly blocked form on 8 or 9
Fridays in October, November, and December (possibly also in January).
Lectures are currently planned for the following dates in winter term 2015/16:
Oct 9, Oct 30,
Nov 13, Nov 20, Nov 27,
Dec 4, Dec 11, Dec 18, Jan 15

Friday, 11:00 (sharp)  (about) 13:00
Seminar Room von Neumann
Favoritenstraße 9 / ground floor
Various course material  in particular copies of the lecture slides, including
the homework problems ('exercises') 
will be made available here (and/or in the lecture) to all participants.
 Slides, lecture 1 on 9/10/15: [PDF]
 Slides, lecture 2 on 30/10/15: [PDF]
 Slides, lecture 3 on 13/11/15: [PDF]
 Slides, lecture 4 on 20/11/15: [PDF]
 Hints for derivations in Hilbertstyle systems for modal logics
[PDF, 1 page]
 Slides, lecture 5 on 27/11/15: [PDF]
Additional material on the Muddy Children and Three Wise Men examples:
 Slides, lecture 6 on 4/12/15: [PDF] (Class 6 was mainly devoted to the discussion of exercises)

See below for links to further information on epistemic modal logic.
 Slides, lecture 7 on 18/12/15: [PDF]
no slides for fuzzy logics, but see Further links, below,
in particular:
Petr Hajek [PS, 12 pages], final version
appeared in A Companion to Philosophical Logics, edited by Dale Jacquette,
Blackwell 2002.
We strongly recommend the use of LaTeX.
Useful style files are available from
Latex for Logicians.
For drawing graphs and automata  and thus also Kripke models 
the LaTeX package
VauCanSonG should be useful. More options for automata/graph drawing
with LaTeX can be found at MET  Automata in LaTeX.
Also the TeX/LaTeX extension PGF/TikZ is well worth exploring.
Include the problem statement, its number
(`Exercise X: ... ') and your name
in the submitted solution files. Send corresponding
(uncompressed) PDF files via
email to Chris Fermüller
using "NCL exercises" as subject line.
The evaluation will be based on the amount and quality of
submitted solutions to the exercises (as assigned during the course).
Send COMMENTS/REQUESTS to Chris Fermüller
[ LVAs 185/2
 Abteilung 185/2
 Institut 185
 Informatik
 TU Wien
 Server home page
]