Completeness for flat modal fixpoint logics

DOI10.1016/J.APAL.2010.07.003zbMath1225.03020OpenAlexW2516028194MaRDI QIDQ638475

Luigi Santocanale, Yde Venema

Publication date: 12 September 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: http://dare.uva.nl/personal/pure/en/publications/completeness-for-flat-modal-fixpoint-logics(5606606a-7490-402f-8045-ef0a7c397084).html

zbMATH Keywords

modal logicrepresentation theoremcompletenessaxiomatizationmodal algebrafixpoint logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)

Related Items (14)

The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games ⋮ Changing a Semantics: Opportunism or Courage? ⋮ Fixed point logics and definable topological properties ⋮ Fixed point logics and definable topological properties ⋮ Sahlqvist theorem for modal fixed point logic ⋮ Modalities in the Stone age: a comparison of coalgebraic logics ⋮ An expansion of basic logic with fixed points ⋮ Unnamed Item ⋮ Completeness for \(\mu\)-calculi: a coalgebraic approach ⋮ Temporal refinements for guarded recursive types ⋮ Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics ⋮ Unnamed Item ⋮ Coalgebraic logics \& duality ⋮ Unnamed Item

Uses Software

• SPIN
• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relation algebras by games
• Results on the propositional \(\mu\)-calculus
• Completions of \(\mu \)-algebras
• An elementary proof of the completeness of PDL
• Axioms for tense logic. I: 'Since' and 'until'
• Complete systems of \(\mathcal B\)-rational identities
• Coalgebraic logic
• A completeness theorem for Kleene algebras and the algebra of regular events
• On the equational definition of the least prefixed point.
• Universal coalgebra: A theory of systems
• Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
• Decision procedures and expressiveness in the temporal logic of branching time
• Matrix and matricial iteration theories. I
• Automata and fixed point logic: a coalgebraic perspective
• Normal forms in modal logic
• The representation of relational algebras
• A lattice-theoretical fixpoint theorem and its applications
• Automata for the modal μ-calculus and related results
• Nabla Algebras and Chu Spaces
• Coalgebraic Automata Theory: Basic Results
• Some Varieties Containing Relation Algebras
• Une condition impliquant toutes les identités rationnelles
• Formal Methods for the Design of Real-Time Systems
• Rudiments of \(\mu\)-calculus

This page was built for publication: Completeness for flat modal fixpoint logics