Pages that link to "Item:Q1854336"
From MaRDI portal
The following pages link to Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus. (Q1854336):
Displaying 48 items.
- Sahlqvist theorem for modal fixed point logic (Q418010) (← links)
- Refinement modal logic (Q476194) (← links)
- Spatial logic of tangled closure operators and modal mu-calculus (Q515566) (← links)
- An axiomatization of bisimulation quantifiers via the \(\mu\)-calculus (Q557788) (← links)
- Completeness for flat modal fixpoint logics (Q638475) (← links)
- Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← 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)
- On modal \(\mu \)-calculus and Gödel-Löb logic (Q1015480) (← links)
- Duality for modal \(\mu\)-logics (Q1128984) (← links)
- Axiomatising extended computation tree logic (Q1389439) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- On the equational definition of the least prefixed point. (Q1401250) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Completeness for \(\mu\)-calculi: a coalgebraic approach (Q1731842) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- On decidability of recursive weighted logics (Q1797779) (← links)
- Intuitionistic Podelski-Rybalchenko theorem and equivalence between inductive definitions and cyclic proofs (Q1798782) (← links)
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS (Q1878715) (← links)
- A Buchholz rule for modal fixed point logics (Q1942334) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) (Q2011666) (← links)
- Program schemata technique for propositional program logics: a 30-year history (Q2216719) (← links)
- Temporal refinements for guarded recursive types (Q2233479) (← links)
- Complete proof systems for weighted modal logic (Q2253184) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- On modal \(\mu\)-calculus with explicit interpolants (Q2506827) (← links)
- Extracting Proofs from Tabled Proof Search (Q2938048) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Program Schemata Technique to Solve Propositional Program Logics Revised (Q3179178) (← links)
- Changing a Semantics: Opportunism or Courage? (Q3454820) (← links)
- EXPTIME Tableaux for the Coalgebraic μ-Calculus (Q3644748) (← links)
- Domain mu-calculus (Q4460689) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- (Q4603451) (← links)
- Beliefs supported by binary arguments (Q4685528) (← links)
- $\aleph_1$ and the modal $\mu$-calculus (Q4972732) (← links)
- (Q5014445) (← links)
- (Q5014447) (← links)
- (Q5015268) (← links)
- (Q5129949) (← links)
- (Q5155678) (← links)
- The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
- Alternation-free weighted mu-calculus: decidability and completeness (Q5971405) (← links)
- Fixed point logics and definable topological properties (Q6149964) (← links)
