HOME

TheInfoList



OR:

In
logic Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure o ...
and
philosophy Philosophy ('love of wisdom' in Ancient Greek) is a systematic study of general and fundamental questions concerning topics like existence, reason, knowledge, Value (ethics and social sciences), value, mind, and language. It is a rational an ...
, S5 is one of five systems of
modal logic Modal logic is a kind of logic used to represent statements about Modality (natural language), necessity and possibility. In philosophy and related fields it is used as a tool for understanding concepts such as knowledge, obligation, and causality ...
proposed by
Clarence Irving Lewis Clarence Irving Lewis (April 12, 1883 – February 3, 1964) was an American academic philosopher. He is considered the progenitor of modern modal logic and the founder of conceptual pragmatism. First a noted logician, he later branched into epis ...
and
Cooper Harold Langford Cooper Harold Langford (25 August 1895, Dublin, Logan County, Arkansas – 28 August 1964) was an American analytic philosopher and mathematical logician who co-authored the book ''Symbolic Logic'' (1932) with Clarence Irving Lewis, C. I. Lewis. ...
in their 1932 book ''Symbolic Logic''. It is a
normal modal logic In logic, a normal modal logic is a set ''L'' of modal formulas such that ''L'' contains: * All propositional tautology (logic), tautologies; * All instances of the Kripke_semantics, Kripke schema: \Box(A\to B)\to(\Box A\to\Box B) and it is closed ...
, and one of the oldest systems of modal logic of any kind. It is formed with
propositional calculus The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
formulas and tautologies, and inference apparatus with substitution and
modus ponens In propositional logic, (; MP), also known as (), implication elimination, or affirming the antecedent, is a deductive argument form and rule of inference. It can be summarized as "''P'' implies ''Q.'' ''P'' is true. Therefore, ''Q'' must ...
, but extending the syntax with the
modal operator A modal connective (or modal operator) is a logical connective for modal logic. It is an operator which forms propositions from propositions. In general, a modal operator has the "formal" property of being non- truth-functional in the following se ...
''necessarily'' \Box and its dual ''possibly'' \Diamond.


The axioms of S5

The following makes use of the modal operators \Box ("necessarily") and \Diamond ("possibly"). S5 is characterized by the axioms: *K: \Box(A\to B)\to(\Box A\to\Box B); *T: \Box A \to A, and either: * 5: \Diamond A\to \Box\Diamond A; * or both of the following: :* 4: \Box A\to\Box\Box A, and :* B: A\to\Box\Diamond A. The (5) axiom restricts the
accessibility relation An accessibility relation is a relation (math), relation which plays a key role in assigning truth values to sentences in the Kripke semantics, relational semantics for modal logic. In relational semantics, a modal formula's truth value at a '' ...
R of the
Kripke frame 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é J ...
to be Euclidean, i.e. (wRv \land wRu) \implies vRu , thereby conflating necessity with possibility under
idempotence Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
.


Kripke semantics

In terms of
Kripke semantics 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é ...
, S5 is characterized by frames where the accessibility relation is an
equivalence relation In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is equ ...
: it is reflexive, transitive, and
symmetric Symmetry () in everyday life refers to a sense of harmonious and beautiful proportion and balance. In mathematics, the term has a more precise definition and is usually used to refer to an object that is invariant under some transformations ...
. Determining the satisfiability of an S5 formula is an
NP-complete In computational complexity theory, NP-complete problems are the hardest of the problems to which ''solutions'' can be verified ''quickly''. Somewhat more precisely, a problem is NP-complete when: # It is a decision problem, meaning that for any ...
problem. The hardness proof is trivial, as S5 includes the
propositional logic The propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. Sometimes, it is called ''first-order'' propositional logic to contra ...
. Membership is proved by showing that any satisfiable formula has a Kripke model where the number of worlds is at most linear in the size of the formula.


Applications

S5 is useful because it avoids superfluous iteration of qualifiers of different kinds. For example, under S5, if ''X'' is necessarily, possibly, necessarily, possibly true, then ''X'' is possibly true. Unbolded qualifiers before the final "possibly" are pruned in S5. While this is useful for keeping propositions reasonably short, it also might appear counter-intuitive in that, under S5, if something is possibly necessary, then it is necessary.
Alvin Plantinga Alvin Carl Plantinga (born November 15, 1932) is an American analytic philosophy, analytic philosopher who works primarily in the fields of philosophy of religion, epistemology (particularly on issues involving theory of justification, epistemic ...
has argued that this feature of S5 is not, in fact, counter-intuitive. To justify, he reasons that if ''X'' is ''possibly necessary'', it is necessary in at least one
possible world A possible world is a complete and consistent way the world is or could have been. Possible worlds are widely used as a formal device in logic, philosophy, and linguistics in order to provide a semantics for intensional and modal logic. Their met ...
; hence it is necessary in ''all'' possible worlds and thus is true in all possible worlds. Such reasoning underpins 'modal' formulations of the
ontological argument In the philosophy of religion, an ontological argument is a deductive philosophical argument, made from an ontological basis, that is advanced in support of the existence of God. Such arguments tend to refer to the state of being or existing. ...
. S5 is equivalent to the adjunction \Diamond\dashv\Box.
Leibniz Gottfried Wilhelm Leibniz (or Leibnitz; – 14 November 1716) was a German polymath active as a mathematician, philosopher, scientist and diplomat who is credited, alongside Sir Isaac Newton, with the creation of calculus in addition to many ...
proposed an
ontological argument In the philosophy of religion, an ontological argument is a deductive philosophical argument, made from an ontological basis, that is advanced in support of the existence of God. Such arguments tend to refer to the state of being or existing. ...
for the existence of God using this axiom. In his words, "If a necessary being is possible, it follows that it exists actually". S5 is also the modal system for the metaphysics of saint
Thomas Aquinas Thomas Aquinas ( ; ; – 7 March 1274) was an Italian Dominican Order, Dominican friar and Catholic priest, priest, the foremost Scholasticism, Scholastic thinker, as well as one of the most influential philosophers and theologians in the W ...
and in particular for the Five Ways. However, these applications require that each operator is in a serial arrangement of a single modality. Under
multimodal logic A multimodal logic is a modal logic that has more than one primitive modal operator. They find substantial applications in theoretical computer science. Overview A modal logic with ''n'' primitive unary modal operators \Box_i, i\in \ is called an ' ...
, e.g., "X is possibly (in epistemic modality, per one's data) necessary (in alethic modality)," it no longer follows that X being necessary in at least one epistemically possible world means it is necessary in all epistemically possible worlds. This aligns with the intuition that proposing a certain necessary entity does not mean it is real.


See also

*
Modal logic Modal logic is a kind of logic used to represent statements about Modality (natural language), necessity and possibility. In philosophy and related fields it is used as a tool for understanding concepts such as knowledge, obligation, and causality ...
*
Normal modal logic In logic, a normal modal logic is a set ''L'' of modal formulas such that ''L'' contains: * All propositional tautology (logic), tautologies; * All instances of the Kripke_semantics, Kripke schema: \Box(A\to B)\to(\Box A\to\Box B) and it is closed ...
*
Kripke semantics 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é ...


References

{{Reflist


External links

* http://home.utah.edu/~nahaj/logic/structures/systems/s5.html
Modal Logic
at the Stanford Encyclopedia of Philosophy Modal logic