The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
A Natural Deduction style proof system for propositional μ-calculus and its formalization in inductive type theories
[article]
1998
arXiv
pre-print
In this paper, we present a formalization of Kozen's propositional modal μ-calculus, in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the encoding of modal ("proof") rules and of context sensitive grammars. The encoding can be used in the system, providing an experimental computer-aided proof environment for the interactive development of error-free proofs
arXiv:cs/9809120v1
fatcat:4xvfgdugeffwtjmelzlaijthn4