Modal Logic
By Patrick Blackburn, Maarten de Rijke, Y. Venema. Cambridge Tracts in Theoretical Computer Science, 2001
4,290 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/ede9d823f535e5266a1bba1019aaf7978886e1f9
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Hans van Ditmarsch
- Barteld P. Kooi
- Wiebe van der Hoek
- Sonja Smets
- Sara Negri
- David Ten Cate
- Alexandru Baltag
- Christoph Schmidt-Petri
Citations in the corpus
- Model theory for extended modal languages (2005, methodology): “It is well known that K does not reflect ultrafilter extensions [21], and hence it is not closed under ultrafilter morphic images.”
- Degrees of Belief (2009, background): “Notice that the spirit behind such belief/plausibility pairs is very similar to the modal operators (necessity) and ♦ (possibility) in modal logic [7].”
- Semi-qualitative Reasoning about Distances: A Preliminary Report (2000, background): “[3]) the relational metric model S = S(M1) through some suitable set of terms cl( ).”
- A qualitative theory of dynamic interactive belief revision (2008, background): “18 Intuitively, the precondition defines the domain of applicability of σ : this action can be executed on a state s iff s satisfies its precondition.”
- A Syntactic Approach to Rationality in Games with Ordinal Payoffs (2008, background): “The formal language is built in the usual way (see [3] and [10]) from a countable set A of atomic propositions, the connectives ¬ and ∨ (from which the connectives ∧, → and ↔ are defined as usual) and the modal operators.”
- Dynamic Epistemic Logic (2007, background): “Possibilities and Kripke models are closely linked: possibilities correspond to bisimulation classes of Kripke models [18].”
- Dynamic logic of preference upgrade (2007, unknown): “[BLA 01]).”
- Proof Analysis in Modal Logic (2005, result): “We conclude with an alternative approach to proofs of negative results in correspondence theory (Van Benthem, 1984; Blackburn, Rijke, and Venema, 2001).”
- Explicit provability and constructive semantics (2001, background): “The BHK semantics is widely recognized as the intended semantics for intuitionistic logic ([33], [34], [43], [62], [74], [78], [104], [105], [107], [108], [111], [114]).”