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

DOI10.1145/2933575.2933598zbMath1401.68193OpenAlexW2529880865MaRDI QIDQ4635894

Lucca Hirschi, David Baelde, Amina Doumane, Alexis Saurin

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2933575.2933598

zbMATH Keywords

sequent calculusmu-calculusparity automataproof-searchcircular proofs(co)inductionSafra construction

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Structure of proofs (03F07)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Non-well-founded deduction for induction and coinduction

This page was built for publication: Towards Completeness via Proof Search in the Linear Time μ-calculus