Project

Completeness for the modal mu-calculus (June 2008)


This page concerns the project `Completeness for the modal mu-calculus', taught at the University of Amsterdam in June 2008.

Contents of these pages


News


Earlier meetings


Project Description

The modal mu-calculus is an extension of modal logic with fixpoint operators which was introduced in the early 1980s. It is an important formalism with many applications, in computer science and elsewhere, and an interesting mathematical theory. It shares many attractive properties with ordinary modal logic, but has a much bigger expressive power. In 1983 an axiomatization for the modal mu-calculus was proposed by Dexter Kozen, and this axiomatization was proved to be complete by Igor Walukiewicz in the 1990s. The aim of the project is to go in detail through Walukiewicz' notoriously difficult paper ``Completeness of Kozen's axiomatization of the Propositional mu-Calculus", Information and Computation 157 (2000) 142--182.

Prerequisites

Students are assumed to have a working knowledge of the syntax and semantics of the modal mu-calculus. More precisely, we build on the material covered in the course Capital Selecta in Modal Logic, Algebra and Coalgebra of this year.

Practicalities

Staff

Dates/location:

Course material

Grading


Comments, complaints, questions: mail Yde Venema