General Models and Completeness of First-Order Modal -calculus

DOI10.1093/LOGCOM/EXM077zbMATH Open1150.03008OpenAlexW2054834413MaRDI QIDQ3520232FDOQ3520232

Keishi Okamoto, Ryo Kashima

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

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
• scientific article; zbMATH DE number 7297836
• Sequent calculi for the modal \(\mu \)-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

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)

Cited In (4)

• Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
• A linear translation from CTL\(^*\) to the first-order modal \(\mu \)-calculus
• Modal definability of first-order formulas with free variables and query answering
• Title not available (Why is that?)

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)