S5 (modal logic)

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP




In logic and philosophy, S5 is one of five systems of modal logic proposed by
Clarence Irving Lewis and Cooper Harold Langford in their 1932 book Symbolic Logic.
It is a normal modal logic, and one of the oldest systems of modal logic of any kind. Is the most basic modal logic, is formed with propositional calculus formulas and tautologies, and inference apparatus with substitution and modus ponens, but extending the syntax with the modal operator necessarily ◻displaystyle Box Box and its dual possibly ◊displaystyle Diamond Diamond .[1][2]




Contents





  • 1 The axioms of S5


  • 2 Kripke semantics


  • 3 Applications


  • 4 See also


  • 5 References


  • 6 External links




The axioms of S5


The following makes use of the modal operators ◻displaystyle Box Box ("necessarily") and ◊displaystyle Diamond Diamond ("possibly").


S5 is characterized by the axioms:



  • K: ◻(A→B)→(◻A→◻B)displaystyle Box (Ato B)to (Box Ato Box B)Box (Ato B)to (Box Ato Box B);


  • T: ◻A→Adisplaystyle Box Ato ABox Ato A,

and either:



  • 5: ◊A→◻◊Adisplaystyle Diamond Ato Box Diamond ADiamond Ato Box Diamond A;

  • or both of the following:


  • 4: ◻A→◻◻Adisplaystyle Box Ato Box Box ABox Ato Box Box A, and


  • B: A→◻◊Adisplaystyle Ato Box Diamond AAto Box Diamond A.

The (5) axiom restricts the accessibility relation Rdisplaystyle RR of the Kripke frame to be Euclidean, i.e. (wRv∧wRu)⟹vRudisplaystyle (wRvland wRu)implies vRudisplaystyle (wRvland wRu)implies vRu.



Kripke semantics


In terms of Kripke semantics, S5 is characterized by models where the accessibility relation is an equivalence relation: it is reflexive, transitive, and symmetric.


Determining the satisfiability of an S5 formula is an NP-complete problem. The hardness proof is trivial, as S5 includes the propositional logic. 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 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; 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.



See also


  • Modal logic

  • Normal modal logic

  • Kripke semantics


References




  1. ^ Chellas, B. F. (1980) Modal Logic: An Introduction. Cambridge University Press. .mw-parser-output cite.citationfont-style:inherit.mw-parser-output qquotes:"""""""'""'".mw-parser-output code.cs1-codecolor:inherit;background:inherit;border:inherit;padding:inherit.mw-parser-output .cs1-lock-free abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-lock-subscription abackground:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registrationcolor:#555.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration spanborder-bottom:1px dotted;cursor:help.mw-parser-output .cs1-hidden-errordisplay:none;font-size:100%.mw-parser-output .cs1-visible-errorfont-size:100%.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-formatfont-size:95%.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-leftpadding-left:0.2em.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-rightpadding-right:0.2em
    ISBN 0-521-22476-4



  2. ^ Hughes, G. E., and Cresswell, M. J. (1996) A New Introduction to Modal Logic. Routledge.
    ISBN 0-415-12599-5





External links


  • http://home.utah.edu/~nahaj/logic/structures/systems/s5.html


  • Modal Logic at the Stanford Encyclopedia of Philosophy

Popular posts from this blog

California gubernatorial recall election

Telugu cinema

List of Pawn Stars episodes