A focus system for the alternation-free \(\mu \)-calculus

DOI10.1007/978-3-030-86059-2_22OpenAlexW3197192617MaRDI QIDQ2142090

Johannes Marti, Yde Venema

Publication date: 25 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86059-2_22

zbMATH Keywords

completenesssoundnessinfinitary proof systemalternation-free mu-calculuscircular proof system

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

Focus-style proofs for the two-way alternation-free \(\mu \)-calculus ⋮ Abstract cyclic proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity
• Games for the \(\mu\)-calculus
• Results on the propositional \(\mu\)-calculus
• On the proof theory of the modal mu-calculus
• Alternating automata, the weak monadic theory of trees and its complexity
• Automata, logics, and infinite games. A guide to current research
• Temporal Logics in Computer Science
• Automata for the modal μ-calculus and related results
• A Tableau System for the Modal μ-Calculus
• The modalμ-calculus hierarchy over restricted classes of transition systems
• Logic Programming with Focusing Proofs in Linear Logic
• The Complexity of Tree Automata and Logics of Programs
• The Power of the Weak
• A Proof System for the Linear Time μ-Calculus
• Rudiments of \(\mu\)-calculus
• Alternating tree automata, parity games, and modal \(\mu\)-calculus
• On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic

This page was built for publication: A focus system for the alternation-free \(\mu \)-calculus