scientific article; zbMATH DE number 3799616
From MaRDI portal
Publication:4744245
zbMath0507.03005MaRDI QIDQ4744245
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65)
Related Items
Concurrent program schemes and their logics, Abstraction and Abstraction Refinement, An automata theoretic decision procedure for the propositional mu- calculus, A methodology for designing proof rules for fair parallel programs, An abstract interpretation toolkit for \(\mu\)CRL, Elimination of detached regions in dependency graph verification, Contribution of Warsaw logicians to computational logic, A refinement calculus for specifications in Hennessy-Milner logic with recursion, Proof systems for satisfiability in Hennessy-Milner logic with recursion, Unnamed Item, Mathematical modal logic: A view of its evolution, Alternation-free weighted mu-calculus: decidability and completeness, Bounded semantics, Matching µ-logic: Foundation of K framework, GR(1)*: GR(1) specifications extended with existential guarantees, Axiomatizing fixpoint logics, The expressive power of implicit specifications, Complete proof systems for weighted modal logic, A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus, From Philosophical to Industrial Logics, On strictly arithmetical completeness in logics of programs, From Monadic Logic to PSL, Non-well-founded deduction for induction and coinduction, Equivalences among logics of programs, Results on the propositional \(\mu\)-calculus
