scientific article; zbMATH DE number 6841180
From MaRDI portal
Publication:4603451
DOI10.23638/LMCS-14(1:14)2018zbMath1459.03022arXiv1801.05994MaRDI QIDQ4603451
Publication date: 20 February 2018
Full work available at URL: https://arxiv.org/abs/1801.05994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
\(\mu\)-calculusmodel theorycharacterization resultsScott continuitymodal fixpoint logicmodal automatafull additivity
Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (3)
$\aleph_1$ and the modal $\mu$-calculus ⋮ Model theory of monadic predicate logic with the infinity quantifier ⋮ Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Results on the propositional \(\mu\)-calculus
- A new modal Lindström theorem
- Coalgebraic logic
- Model theory
- Characterizations of negative definability in modal logic
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Automata, logics, and infinite games. A guide to current research
- A general Lindström theorem for some normal modal logics
- Modal frame correspondences and fixed-points
- Continuous Fragment of the mu-Calculus
- Automata for the modal μ-calculus and related results
- Automata for Coalgebras: An Approach Using Predicate Liftings
- Coalgebraic Automata Theory: Basic Results
- EXPTIME Tableaux for the Coalgebraic μ-Calculus
- Categories of frames for modal logic
- Weak MSO
- PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic
- On guarded transformation in the modal -calculus
- Logical questions concerning the μ-calculus: Interpolation, Lyndon and Łoś-Tarski
- A Characterization Theorem for the Alternation-Free Fragment of the Modal µ-Calculus
- Completeness for coalgebraic fixpoint logic
- Boolean Algebras with Operators. Part I
- Boolean Algebras with Operators
- Rudiments of \(\mu\)-calculus
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication:
