Pages that link to "Item:Q1117213"

The following pages link to A finite model theorem for the propositional \(\mu\)-calculus (Q1117213):

Displaying 31 items.

• Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
• Effective cut-elimination for a fragment of modal mu-calculus (Q454366) (← links)
• Duality and the completeness of the modal \(\mu\)-calculus (Q671986) (← links)
• Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
• On the modal definability of simulability by finite transitive models (Q763328) (← links)
• Results on the propositional \(\mu\)-calculus (Q801893) (← links)
• Completions of \(\mu \)-algebras (Q925850) (← links)
• Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
• On the proof theory of the modal mu-calculus (Q1005937) (← links)
• The finite model property and recursive bounds on the size of countermodels (Q1063587) (← links)
• An automata theoretic decision procedure for the propositional mu- calculus (Q1119630) (← links)
• Duality for modal \(\mu\)-logics (Q1128984) (← links)
• The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
• Mathematical modal logic: A view of its evolution (Q1422628) (← links)
• Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
• A Buchholz rule for modal fixed point logics (Q1942334) (← links)
• On logics with two variables (Q1960419) (← links)
• Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
• The finite model property for the implicational fragment of IPC without exchange and contraction (Q1970644) (← links)
• Temporal logic with recursion (Q2051830) (← links)
• A small model theorem for the hybrid  -calculus (Q3195619) (← links)
• (Q3384164) (← links)
• Modal and mixed specifications: key decision problems and their complexities (Q3550702) (← links)
• An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (Q3557849) (← links)
• The modal<i>μ</i>-calculus hierarchy over restricted classes of transition systems (Q3655261) (← links)
• (Q5009450) (← links)
• (Q5111441) (← links)
• A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus (Q5689266) (← links)
• Laver and set theory (Q5964933) (← links)
• Temporal Logic with Recursion. (Q6060093) (← links)
• A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points (Q6541152) (← links)