The following pages link to Finiteness is mu-ineffable (Q1236111):
Displaying 17 items.
- Equivalences among logics of programs (Q801684) (← links)
- A functional programming approach to the specification and verification of concurrent systems (Q909439) (← links)
- Concurrent program schemes and their logics (Q1094866) (← links)
- An automata theoretic decision procedure for the propositional mu- calculus (Q1119630) (← links)
- Definability in dynamic logic (Q1158140) (← links)
- On some classes of interpretations (Q1251892) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- BDD-Based Symbolic Model Checking (Q3176366) (← links)
- Combining Model Checking and Deduction (Q3176378) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- On global induction mechanisms in a<i>μ</i>-calculus with explicit approximations (Q4460690) (← links)
- Interfaces between languages for communicating systems (Q5204354) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
