Chapter 9 Modal Language, Syntax, and Semantics - David W. Agler

7.8.9.10.9.5 Modal Logic TranslationWith the symbols, syntax, and semantics of ML articulated, ML allows for the symbolization ofa number of propositions previously impossible with PL. For example, consider the argument putforward at the beginning of this chapter:It is necessary that John is happy.Therefore, John is happy.The language of ML, now makes it possible to translate this argument as follows:□J ⊢ JIn addition to the above translations, the language of ML makes possible a number oftranslations that were previously impossible in PL:English SentenceIt is possible that John is a zombie.It is necessarily the case that Frank is a vampire.It is possible that both John is a zombie and Mary is not a mutant.It is not necessarily the case that Frank is a not a vampire or Mary is not amutant.Translation into ML◊J□F◊ (J∧¬M)¬□(¬F∨¬M)In many cases, translating an English sentence involving the wff in ML can be done in astraightforward manner, assigning upper-case letters to simple sentences, assigning truthfunctionaloperators like “¬” and “∧” to propositional operators like “not” and “and,” and thenthe modal operators “◊” and “□” to modal terms like terms like “can” and “must.” Let’s call anytranslation of this type, a surface translation.Fortunately or unfortunately, not every English sentence can be given a surfacetranslation. For consider the following sentence(1) If Vic is a bachelor, then he must not be married.If we represent ‘Vic is a bachelor’ as ‘B’ and ‘John is not married’ as ‘¬M’, a si(2) B→□¬M14