General Models and Completeness of First-Order Modal -calculus

DOI10.1093/LOGCOM/EXM077MaRDI QIDQ3520232zbMATH OpenOpenAlexFDO

Authors Ryo Kashima, Keishi Okamoto

Publication date 15 August 2008

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/exm077

zbMATH Keywords

completenessfirst-order logicKripke modelsmodal logic\(\mu\)-calculusgeneral models

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Recommendations

• On the \(\mu \)-calculus over transitive and finite transitive frames
• A Note on the Completeness of Kozen's Axiomatisation of the Propositional μ-Calculus
• Modal logics and mu-calculi: An introduction
• scientific article; zbMATH DE number 5898613
• scientific article; zbMATH DE number 7297836
• Sequent calculi for the modal -calculus over S5
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Some model theory for the modal \(\mu\)-calculus: syntactic characterisations of semantic properties
• An infinitary treatment of full \(\mu\)-calculus
• Sahlqvist correspondence for modal mu-calculus

Cited in

(5)

• A linear translation from CTL^* to the first-order modal -calculus
• Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
• Modal definability of first-order formulas with free variables and query answering
• scientific article; zbMATH DE number 7297836 (Why is no real title available?)
• First-order -calculus over generic transition systems and applications to the situation calculus

This page was built for publication: General Models and Completeness of First-Order Modal  -calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520232)