An extension of
propositional calculus with operators that express various "modes" of truth. Examples of modes are: necessarily A, possibly A, probably A, it has always been true that A, it is permissible that A, it is believed that A. "It is necessarily true that A" means that things being 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 even though "x=y" might be TRUE. Adding modal operators [F] and [P], meaning, respectively, henceforth and hitherto leads to a "
temporal loGIc". Flavours of modal lo
GIcs include: {Propositional Dynamic Lo
GIc} (PDL), {Propositional Linear Temporal Lo
GIc} (PLTL),
Linear Temporal LoGIc (LTL),
Computational Tree LoGIc (CTL),
Hennessy-Milner LoGIc, S1-S5, T. C.I. Lewis, "A Survey of Symbolic Lo
GIc", 1918, initiated the modern analysis of modality. He developed the lo
GIcal systems S1-S5. JCC McKinsey used algebraic methods ({Boolean algebra}s with operators) to prove the decidability of Lewis' S2 and S4 in 1941. Saul Kripke developed the {relational semantics} for modal lo
GIcs (1959, 1963). Vaughan Pratt introduced
dynamic loGIc in 1976. Amir Pnuelli proposed the use of temporal lo
GIc to formalise the behaviour of continually operating
concurrent programs in 1977. [Robert Goldblatt, "Lo
GIcs of Time and Computation", CSLI Lecture Notes No. 7, Centre for the Study of Language and Information, Stanford University, Second Edition, 1992, (distributed by University of Chicago Press)]. [Robert Goldblatt, "Mathematics of Modality", CSLI Lecture Notes No. 43, Centre for the Study of Language and Information, Stanford University, 1993, (distributed by University of Chicago Press)]. [G.E. Hughes and M.J. Cresswell, "An Introduction to Modal Lo
GIc", Methuen, 1968]. [E.J. Lemmon (with Dana Scott), "An Introduction to Modal Lo
GIc", American Philosophical Quarterly Monograpph Series, no. 11 (ed. by Krister Segerberg), Basil Blackwell, Oxford, 1977]. (1995-02-15)
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 ]