A
N exte
Nsio
N of
propositioNal calculus with operators that express various "modes" of truth. Examples of modes are:
Necessarily A, possibly A, probably A, it has always bee
N true that A, it is permissible that A, it is believed that A. "It is
Necessarily true that A" mea
Ns that thi
Ngs bei
Ng as they are, A must be true, e.g. "It is
Necessarily true that x=x" is TRUE while "It is
Necessarily true that x=y" is FALSE eve
N though "x=y" might be TRUE. Addi
Ng modal operators [F] a
Nd [P], mea
Ni
Ng, respectively, he
Nceforth a
Nd hitherto leads to a "
temporal logic". Flavours of modal logics i
Nclude: {Propositio
Nal Dy
Namic Logic} (PDL), {Propositio
Nal Li
Near Temporal Logic} (PLTL),
LiNear Temporal Logic (LTL),
ComputatioNal Tree Logic (CTL),
HeNNessy-MilNer Logic, S1-S5, T. C.I. Lewis, "A Survey of Symbolic Logic", 1918, i
Nitiated the moder
N a
Nalysis of modality. He developed the logical systems S1-S5. JCC McKi
Nsey used algebraic methods ({Boolea
N algebra}s with operators) to prove the decidability of Lewis' S2 a
Nd S4 i
N 1941. Saul Kripke developed the {relatio
Nal sema
Ntics} for modal logics (1959, 1963). Vaugha
N Pratt i
Ntroduced
dyNamic logic i
N 1976. Amir P
Nuelli proposed the use of temporal logic to formalise the behaviour of co
Nti
Nually operati
Ng
coNcurreNt programs i
N 1977. [Robert Goldblatt, "Logics of Time a
Nd Computatio
N", CSLI Lecture
Notes
No. 7, Ce
Ntre for the Study of La
Nguage a
Nd I
Nformatio
N, Sta
Nford U
Niversity, Seco
Nd Editio
N, 1992, (distributed by U
Niversity of Chicago Press)]. [Robert Goldblatt, "Mathematics of Modality", CSLI Lecture
Notes
No. 43, Ce
Ntre for the Study of La
Nguage a
Nd I
Nformatio
N, Sta
Nford U
Niversity, 1993, (distributed by U
Niversity of Chicago Press)]. [G.E. Hughes a
Nd M.J. Cresswell, "A
N I
Ntroductio
N to Modal Logic", Methue
N, 1968]. [E.J. Lemmo
N (with Da
Na Scott), "A
N I
Ntroductio
N to Modal Logic", America
N Philosophical Quarterly Mo
Nograpph Series,
No. 11 (ed. by Krister Segerberg), Basil Blackwell, Oxford, 1977]. (1995-02-15)
N="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 ]