A finite model theorem for the propositional \(\mu\)-calculus
From MaRDI portal
Publication:1117213
DOI10.1007/BF00370554zbMath0667.03019MaRDI QIDQ1117213
Publication date: 1989
Published in: Studia Logica (Search for Journal in Brave)
Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Model theory of finite structures (03C13)
Related Items
Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints, Duality for modal \(\mu\)-logics, Satisfiability of quantitative probabilistic CTL: rise to the challenge, A Buchholz rule for modal fixed point logics, Unnamed Item, Unnamed Item, Effective cut-elimination for a fragment of modal mu-calculus, Mathematical modal logic: A view of its evolution, On logics with two variables, Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus, Completions of \(\mu \)-algebras, Modal and mixed specifications: key decision problems and their complexities, Canonical completeness of infinitary \(\mu \), Duality and the completeness of the modal \(\mu\)-calculus, Temporal Logic with Recursion., Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics, Syntactic cut-elimination for a fragment of the modal mu-calculus, Laver and set theory, On the proof theory of the modal mu-calculus, Temporal logic with recursion, The modal mu-calculus alternation hierarchy is strict, On the modal definability of simulability by finite transitive models, The modalμ-calculus hierarchy over restricted classes of transition systems
Cites Work
