In logic, a normal modal logic is a set L of modal formulas such that L contains:
All propositional tautologies;
All instances of the Kripke schema:
and it is closed under:
Detachment rule (modus ponens): implies ;
Necessitation rule: implies .
The smallest logic satisfying the above conditions is called K. Most modal logics commonly used nowadays (in terms of having philosophical motivations), e.g. C. I. Lewis's S4 and S5, are normal (and hence are extensions of K). However a number of deontic and epistemic logics, for example, are non-normal, often because they give up the Kripke schema.
Every normal modal logic is regular and hence classical.
The following table lists several common normal modal systems. The notation refers to the table at Kripke semantics § Common modal axiom schemata. Frame conditions for some of the systems were simplified: the logics are sound and complete with respect to the frame classes given in the table, but they may correspond to a larger class of frames.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Kripke semantics (also known as relational semantics or frame semantics, and often confused with possible world semantics) is a formal semantics for non-classical logic systems created in the late 1950s and early 1960s by Saul Kripke and André Joyal. It was first conceived for modal logics, and later adapted to intuitionistic logic and other non-classical systems. The development of Kripke semantics was a breakthrough in the theory of non-classical logics, because the model theory of such logics was almost non-existent before Kripke (algebraic semantics existed, but were considered 'syntax in disguise').
In modal logic, a classical modal logic L is any modal logic containing (as axiom or theorem) the duality of the modal operators that is also closed under the rule Alternatively, one can give a dual definition of L by which L is classical if and only if it contains (as axiom or theorem) and is closed under the rule The weakest classical system is sometimes referred to as E and is non-normal. Both algebraic and neighborhood semantics characterize familiar classical modal systems that are weaker than the weakest normal modal logic K.
Epistemic modal logic is a subfield of modal logic that is concerned with reasoning about knowledge. While epistemology has a long philosophical tradition dating back to Ancient Greece, epistemic logic is a much more recent development with applications in many fields, including philosophy, theoretical computer science, artificial intelligence, economics and linguistics. While philosophers since Aristotle have discussed modal logic, and Medieval philosophers such as Avicenna, Ockham, and Duns Scotus developed many of their observations, it was C.
This article is about a breadth-first exploration of logical concepts in cryptography and their linguistic abstraction and model-theoretic combination in a comprehensive logical system, called CPL (for Cryptographic Protocol Logic). We focus on two fundame ...
This thesis is about a breadth-first exploration of logical concepts in cryptography and their linguistic abstraction and model-theoretic combination in a comprehensive logical system, called CPL (for Cryptographic Protocol Logic). We focus on two fundamen ...
A digital circuit including a signal path with a false path, whereby the signal path includes at least 3 logic instances, the digital circuit further including a logic monitoring element for monitoring a part of the digital circuit, and for outputting a cu ...