An extension of
propositional calculus with operators that express various "modes" of truth. Examples of modes are: necessaril
Y A, possibl
Y A, probabl
Y A, it has alwa
Ys been true that A, it is permissible that A, it is believed that A. "It is necessaril
Y true that A" means that things being as the
Y are, A must be true, e.g. "It is necessaril
Y true that x=x" is TRUE while "It is necessaril
Y true that x=
Y" is FALSE even though "x=
Y" might be TRUE. Adding modal operators [F] and [P], meaning, respectivel
Y, henceforth and hitherto leads to a "
temporal logic". Flavours of modal logics include: {Propositional D
Ynamic Logic} (PDL), {Propositional Linear Temporal Logic} (PLTL),
Linear Temporal Logic (LTL),
Computational Tree Logic (CTL),
HennessY-Milner Logic, S1-S5, T. C.I. Lewis, "A Surve
Y of S
Ymbolic Logic", 1918, initiated the modern anal
Ysis of modalit
Y. He developed the logical s
Ystems S1-S5. JCC McKinse
Y used algebraic methods ({Boolean algebra}s with operators) to prove the decidabilit
Y of Lewis' S2 and S4 in 1941. Saul Kripke developed the {relational semantics} for modal logics (1959, 1963). Vaughan Pratt introduced
dYnamic logic in 1976. Amir Pnuelli proposed the use of temporal logic to formalise the behaviour of continuall
Y operating
concurrent programs in 1977. [Robert Goldblatt, "Logics of Time and Computation", CSLI Lecture Notes No. 7, Centre for the Stud
Y of Language and Information, Stanford Universit
Y, Second Edition, 1992, (distributed b
Y Universit
Y of Chicago Press)]. [Robert Goldblatt, "Mathematics of Modalit
Y", CSLI Lecture Notes No. 43, Centre for the Stud
Y of Language and Information, Stanford Universit
Y, 1993, (distributed b
Y Universit
Y of Chicago Press)]. [G.E. Hughes and M.J. Cresswell, "An Introduction to Modal Logic", Methuen, 1968]. [E.J. Lemmon (with Dana Scott), "An Introduction to Modal Logic", American Philosophical Quarterl
Y Monograpph Series, no. 11 (ed. b
Y Krister Segerberg), Basil Blackwell, Oxford, 1977]. (1995-02-15)
Yle="border-width:thin; border-color:#333333; border-stYle:dashed; padding:5px;" align="left">In addition suitable contents:
[ 2 ] [ = ] [ ad ] [ ag ] [ ai ] [ AL ] [ al ] [ algebra ] [ algebraic ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ as ] [ at ] [ au ] [ av ] [ B ] [ b ] [ ba ] [ be ] [ bi ] [ blat ] [ bo ] [ Boolean ] [ Boolean algebra ] [ br ] [ bY ] [ C ] [ ca ] [ Ch ] [ ch ] [ Chicago ] [ ci ] [ ck ] [ cl ] [ co ] [ con ] [ CSL ] [ CT ] [ CTL ] [ cu ] [ current ] [ D ] [ dd ] [ de ] [ dec ] [ decidabilitY ] [ ding ] [ du ] [ E ] [ ec ] [ ed ] [ ee ] [ eg ] [ eh ] [ er ] [ era ] [ es ] [ et ] [ extension ] [ FALSE ] [ fi ] [ file ] [ fo ] [ for ] [ G ] [ ge ] [ gh ] [ gi ] [ Go ] [ gr ] [ gs ] [ gu ] [ h ] [ hat ] [ hing ] [ hit ] [ hr ] [ ht ] [ hu ] [ hue ] [ id ] [ ie ] [ il ] [ in ] [ inc ] [ include ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ J ] [ K ] [ ke ] [ kw ] [ la ] [ lc ] [ ld ] [ Lex ] [ li ] [ logical ] [ LSE ] [ LTL ] [ lu ] [ lY ] [ M ] [ ma ] [ man ] [ method ] [ mm ] [ mo ] [ mod ] [ modal ] [ mode ] [ module ] [ Mono ] [ mp ] [ ms ] [ mu ] [ N ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ nn ] [ no ] [ Notes ] [ ns ] [ nu ] [ O ] [ om ] [ op ] [ operator ] [ Ox ] [ PD ] [ PDL ] [ pe ] [ ph ] [ pk ] [ pl ] [ PLTL ] [ pr ] [ program ] [ propositional calculus ] [ Q ] [ querY ] [ rc ] [ re ] [ relation ] [ rl ] [ ro ] [ ru ] [ S ] [ sa ] [ SE ] [ se ] [ semantics ] [ si ] [ sit ] [ SL ] [ so ] [ spec ] [ st ] [ Stanford UniversitY ] [ sY ] [ sYstem ] [ T ] [ Tempo ] [ temporal logic ] [ th ] [ to ] [ tr ] [ tt ] [ ua ] [ ug ] [ us ] [ V ] [ va ] [ var ] [ ve ] [ vi ] [ while ]