Introductory
Course on Logic and Automata Theory
Description This
course is intended as an introduction to elementary decision techniques
for various logic using automata theory. The focus will be on the
connection between various logics and types of automata.
INVITED LECTURERS 
In addition to the standard material, there will be two invited
lecturers who will develop the following related topics:
- Florent Garnier (Verimag)
: probabilistic automata (curriculum can be found here)
- Polyvios Pratikakis
(Verimag) : lambda calculus and type theory (curriculum can be found here)
Prerequisites The
students taking this course are expected to be familiar with basic set
theoretic notions (relations, functions, orders, etc) as well as with
boolean and predicate logic (e.g. understand the meaning
of boolean connectors and first-order quantifiers). Students who do not
have these notions must contact the instructor.
A course syllabus can be found here
(postscript).
Lecture notes are available here (postscript).
IMPORTANT:
All lectures will be held in english.
Slides for the lectures are available here (PDF):
Bibliography:
For additional questions please contact the instructor:
radu_._iosif_@_imag_._fr (please remove the _'s)