Parigot suggested symmetric structural reduction rules for ion to µ-abstraction in [9] to ensure unique representation of data type. We prove strong normalization of second order ...
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...