Title :
Completeness of Kozen´s axiomatisation of the propositional μ-calculus
Author_Institution :
Dept. of Comput. Sci., Aarhus Univ.
Abstract :
We consider the propositional μ-calculus as introduced by D. Kozen (1983). In that paper a natural proof system was proposed and its completeness stated as an open problem. We show that the system is complete
Keywords :
temporal logic; theorem proving; completeness of Kozen´s axiomatisation; natural proof system; propositional μ-calculus; Automata; Calculus; Computer science; Informatics; Logic; Technological innovation;
Conference_Titel :
Logic in Computer Science, 1995. LICS '95. Proceedings., Tenth Annual IEEE Symposium on
Conference_Location :
San Diego, CA
Print_ISBN :
0-8186-7050-9
DOI :
10.1109/LICS.1995.523240
