Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Modal logics for communicating systems
Theoretical Computer Science
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
Proof systems for satisfiability in Hennessy-Milner logic with recursion
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Notions of computation and monads
Information and Computation
The Mckinsey axiom is not canonical
Journal of Symbolic Logic
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
Handbook of logic in computer science (vol. 2)
CTL and ECTL as fragments of the modal &mgr;-calculus
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
A modal logic for message passing processes
Acta Informatica
Reasoning about knowledge
Information and Computation
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing
Completeness of Kozen's axiomatisation of the propositional &mgr;-calculus
Information and Computation
An axiomatic basis for computer programming
Communications of the ACM
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
First-Order Dynamic Logic
Modal Logic and Process Algebra: A Bisimulation Perspective
Modal Logic and Process Algebra: A Bisimulation Perspective
Handbook of Process Algebra
"Sometimes" and "not never" revisited: on branching versus linear time (preliminary report)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Process logic: preliminary report
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Results on the Propositional µ-Calculus
Proceedings of the 9th Colloquium on Automata, Languages and Programming
The Propositional Mu-Calculus is Elementary
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
A Decision Procedure for the Propositional µ-Calculus
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Computation tree logic and regular omega-languages
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Completeness of Kozen's Axiomatisation of the Propositional Mu-Calculus
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Propositional modal logic of programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Mathematical Structures in Computer Science
Computational types from a logical perspective
Journal of Functional Programming
An Investigation of the Laws of Thought
An Investigation of the Laws of Thought
Algebraic Structures Related to Many Valued Logical Systems. Part I: Heyting Wajsberg Algebras
Fundamenta Informaticae
Decidability w.r.t. Logical Consecutions of Linear Temporal Logic Extended by Since and Previous
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Logic of Discovery and Knowledge: Decision Algorithm
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Logic of Plausibility for Discovery in Multi-agent Environment Deciding Algorithms
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
Logic of Discovery in Uncertain Situations--- Deciding Algorithms
KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Temporal Extensions of OCL Revisited
ECMDA-FA '09 Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
The complexity of circumscription in description logic
Journal of Artificial Intelligence Research
Logic of discovery and knowledge: decision algorithm
Intelligent Decision Technologies
Rules admissible in transitive temporal logic TS4, sufficient condition
Theoretical Computer Science
AuraConf: a unified approach to authorization and confidentiality
Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Algebraic models of deviant modal operators based on de Morgan and Kleene lattices
Information Sciences: an International Journal
Studia Logica
Generalized modal satisfiability
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Decidability w.r.t. Logical Consecutions of Linear Temporal Logic Extended by Since and Previous
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Algebraic Structures Related to Many Valued Logical Systems. Part I: Heyting Wajsberg Algebras
Fundamenta Informaticae
International Journal of Intelligent Information Technologies
| Hi-index | 0.00 |
This is a survey of the origins of mathematical interpretations of modal logics, and their development over the last century or so. It focuses on the interconnections between algebraic semantics using Boolean algebras with operators and relational semantics using structures often called Kripke models. It reviews the ideas of a number of people who independently contributed to the emergence of relational semantics, and compares them with the work of Kripke. It concludes with an account of several applications of modal model theory to mathematics and theoretical computer science.