Pages that link to "Item:Q1119630"
From MaRDI portal
The following pages link to An automata theoretic decision procedure for the propositional mu- calculus (Q1119630):
Displaying 13 items.
- Logical questions concerning the <i>μ</i>-calculus: Interpolation, Lyndon and Łoś-Tarski (Q4953222) (← links)
- (Q5002827) (← links)
- (Q5021004) (← links)
- Automata, Logic and Games for the $$\lambda $$ -Calculus (Q5224488) (← links)
- Abstraction in Fixpoint Logic (Q5277894) (← links)
- A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus (Q5689266) (← links)
- Axiomatising extended computation tree logic (Q5878903) (← links)
- On model checking for the \(\mu\)-calculus and its fragments (Q5941205) (← links)
- Alternation-free weighted mu-calculus: decidability and completeness (Q5971405) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q6104376) (← links)
- Modal and temporal logics for processes (Q6560391) (← links)
- Coalgebraic satisfiability checking for arithmetic \(\mu\)-calculi (Q6597959) (← links)
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs (Q6649500) (← links)