Towards Completeness via Proof Search in the Linear Time μ-calculus

Amina Doumane, David Baelde, Lucca Hirschi, Alexis Saurin
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
Modal µ-calculus is one of the central languages of logic and verification, whose study involves notoriously complex objects: automata over infinite structures on the model-theoretical side; infinite proofs and proofs by (co)induction on the proof-theoretical side. Nevertheless, axiomatizations have been given for both linear and branching time µ-calculi, with quite involved completeness arguments. We come back to this central problem, considering it from a proof search viewpoint, and provide
more » ... oint, and provide some new completeness arguments in the linear time µ-calculus. Our results only deal with restricted classes of formulas that closely correspond to (nonalternating) ω-automata but, compared to earlier proofs, our completeness arguments are direct and constructive. We first consider a natural circular proof system based on sequent calculus, and show that it is complete for inclusions of parity automata directly expressed as formulas, making use of Safra's construction directly in proof search. We then consider the corresponding finitary proof system, featuring (co)induction rules, and provide a partial translation result from circular to finitary proofs. This yields completeness of the finitary proof system for inclusions of sufficiently deterministic parity automata, and finally for arbitrary Büchi automata.
doi:10.1145/2933575.2933598 dblp:conf/lics/DoumaneBHS16 fatcat:g7cwmr6ddjhitp2xjpmp2sijva