Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
type: Item
instance of: scholarly article
title: Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
zbMATH Open document ID: 1391.68077
author: Sebastian Enqvist
author: F. Seifan
author: Yde Venema
published in: Theoretical Computer Science
publication date: 2018-05-17T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 03D05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6869328
zbMATH Keywords: modal mu-calculus
zbMATH Keywords: modal fixpoint logic
zbMATH Keywords: completeness
zbMATH Keywords: parity automata
zbMATH Keywords: infinite games
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.03.001
OpenAlex ID: W2795525569
cites work: Q5144634
cites work: Rudiments of \(\mu\)-calculus
cites work: Modal logic
cites work: A game semantics for linear logic
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Solving Sequential Conditions by Finite-State Strategies
cites work: CONCUR 2004 - Concurrency Theory
cites work: Q3336675
cites work: Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
cites work: CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
cites work: Q5144621
cites work: “Sometimes” and “not never” revisited
cites work: Completeness for coalgebraic fixpoint logic
cites work: Q5278080
cites work: Automata for Coalgebras: An Approach Using Predicate Liftings
cites work: Q4603451
cites work: An algebraic theory of normal forms
cites work: Spatial logic of tangled closure operators and modal mu-calculus
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Canonical completeness of infinitary \(\mu \)
cites work: Automata for the modal μ-calculus and related results
cites work: On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
cites work: Q4395610
cites work: Results on the propositional \(\mu\)-calculus
cites work: A finite model theorem for the propositional \(\mu\)-calculus
cites work: An elementary proof of the completeness of PDL
cites work: Probabilistic Modal μ-Calculus with Independent Product
cites work: Coalgebraic logic
cites work: Q3753490
cites work: Alternating automata on infinite trees
cites work: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
cites work: Games for the \(\mu\)-calculus
cites work: Q3346126
cites work: Q5624635
cites work: Coalgebraic modal logic: soundness, completeness and decidability of local consequence
cites work: On an interpretation of second order quantification in first order intuitionistic propositional logic
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: An axiomatization of full computation tree logic
cites work: Free \(\mu\)-lattices
cites work: Completions of \(\mu \)-algebras
cites work: Completeness for flat modal fixpoint logics
cites work: Q4539599
cites work: PSPACE bounds for rank-1 modal logics
cites work: Rank-1 Modal Logics are Coalgebraic
cites work: An automata theoretic decision procedure for the propositional mu- calculus
cites work: Q4219045
cites work: Automata and fixed point logic: a coalgebraic perspective
cites work: Q4893140
cites work: Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
cites work: Alternating tree automata, parity games, and modal \(\mu\)-calculus
DOI: 10.1016/J.TCS.2018.03.001
description: scientific article; zbMATH DE number 6869328