Completeness for flat modal fixpoint logics
DOI10.1016/J.APAL.2010.07.003zbMATH Open1225.03020OpenAlexW2516028194MaRDI QIDQ638475FDOQ638475
Authors: 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
Recommendations
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)
Cites Work
- Formal Methods for the Design of Real-Time Systems
- Modal logic
- Title not available (Why is that?)
- Universal coalgebra: A theory of systems
- Matrix and matricial iteration theories. I
- Automata and fixed point logic: a coalgebraic perspective
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coalgebraic logic
- Normal forms in modal logic
- Results on the propositional \(\mu\)-calculus
- Decision procedures and expressiveness in the temporal logic of branching time
- Complete systems of \(\mathcal B\)-rational identities
- A completeness theorem for Kleene algebras and the algebra of regular events
- Une condition impliquant toutes les identités rationnelles
- Relation algebras by games
- Title not available (Why is that?)
- Automata for the modal \(\mu \)-calculus and related results
- Title not available (Why is that?)
- Nabla Algebras and Chu Spaces
- An elementary proof of the completeness of PDL
- Title not available (Why is that?)
- Completeness of the finitary Moss logic
- Coalgebraic Automata Theory: Basic Results
- Title not available (Why is that?)
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Completions of \(\mu \)-algebras
- Some Varieties Containing Relation Algebras
- Rudiments of \(\mu\)-calculus
- The representation of relational algebras
- Axioms for tense logic. I: 'Since' and 'until'
- On the equational definition of the least prefixed point.
Cited In (19)
- Completeness for Flat Modal Fixpoint Logics
- Flat modal fixpoint logics with the converse modality
- Completeness for \(\mu\)-calculi: a coalgebraic approach
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Title not available (Why is that?)
- Fixed point logics and definable topological properties
- Sahlqvist theorem for modal fixed point logic
- Temporal refinements for guarded recursive types
- Modalities in the Stone age: a comparison of coalgebraic logics
- Title not available (Why is that?)
- Completeness of Pledger’s modal logics of one-sorted projective and elliptic planes
- Fixed point logics and definable topological properties
- Coalgebraic logics \& duality
- Axiomatizing fixpoint logics
- Games for topological fixpoint logic
- Title not available (Why is that?)
- The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games
- An expansion of basic logic with fixed points
- Changing a Semantics: Opportunism or Courage?
Uses Software
This page was built for publication: Completeness for flat modal fixpoint logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638475)
