Modal logic in computer science
Explore this paper's citation graph
- Type
- article
- Published
- 2006-01-01
- Cited by
- 0
- References
- 44
- Access
- Open access
- OpenAlex
- https://openalex.org/W33669792
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:59715083
Keywords
Normal modal logic, Accessibility relation, Computer science, Modal, Modal logic
References
- On Integrity Constraints
- A completeness theorem in the modal logic of programs
- SEMANTICAL CONSIDERATIONS ON FLOYD-HOARE LOGIC
- Deontic Logic: Introductory and Systematic Readings
- The Knowledge Complexity of Interactive Proof Systems
- Relationships Between Nondeterministic and Deterministic Tape Complexities
- Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness
- Word problems requiring exponential time(Preliminary Report)
- Propositional Dynamic Logic of Flowcharts
- Dynamic algebras and the nature of induction
- Knowledge and common knowledge in a distributed environment
- A Study of Kripke-type Models for Some Modal Logics by Gentzen's Sequential Method
- The complexity of theorem-proving procedures
- AN AXIOMATIC CHARACTERIZATION OF COMMON KNOWLEDGE
- Concurrent dynamic logic
- Propositional Dynamic Logic of Regular Programs
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
- A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief
- The Propositional Dynamic Logic of Deterministic, Well-Structured Programs (Extended Abstract)
Cited by
No citing papers recorded for this paper.