Adding the everywhere operator to propositional logic.pdfVIP

Adding the Everywhere Operator toPropositional LogicDavid Gries and Fred B. Schneider yComputer Science Department, Cornell UniversityIthaca, New York 14853 USAMay 1, 1996AbstractA sound and complete modal propositional logic S5c is presented in which 2P hasthe interpretation \ P is true in all states. S5c illustrates that the two followingapproaches to axiomatizing a logic need not be equivalent: (i) give axiom schemes thatdenote an innite number of axioms and (ii) write a nite number of axioms in termsof propositional variables and introduce a substitution inference rule.1 IntroductionLogic gives a syntactic way to derive or certify truths that can be expressed in the languageof the logic. The expressiveness of the language impacts the logics utility |the moreexpressive the language, the more useful the logic (at least if the intended use is to provetheorems, as opposed to, say, studying logics). We wish to calculate with logic, much as onecalculates in algebra to derive equations, and we nd it useful for 2P to be a formula ofthe logic and have the meaning \ P is true in all states.When a propositional logic extended with 2 is further extended to predicate logic andthen to other theories, the logic can be used for proving theorems that could otherwise behandled only at the metalevel, and most likely informally. For example, the statementP is valid i 8x:P is valid(1) Supported by NSF grant CDA-9214957 and ARPA/ONR grant N00014-91-J-4123.y Supported in part by ARPA/NSF grant CCR-9014363, NASA/ARPA grant NAG-2-893, and AFOSRgrant F49620-94-1-0198. 1 Table 1: Table of abbreviations ^  : :(: _ :) true : p  p )  : : _  false : :true   : ( ) ) ^ ( ) ) 3 : :2:is formalized in our logic as 2P  2(8x:P ) . In contrast, formalizing (1) as the twoinference rules` P ! ` 8x : P and ` 8x : P ! ` Pdemotes it to a meta-logical notion. When the equivalence of P and 8x:P is not expressibleby a formula of the logic, it is not directly available for use in ca