|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/7239
| Title: | Adding the Everywhere Operator to Propositional Logic |
| Authors: | Gries, David Schneider, Fred B. |
| Keywords: | computer science technical report |
| Issue Date: | May-1996 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR96-1583 |
| Abstract: | Sound and complete modal propositional logic C is presented, in which "P" has the interpretation "P is true in all states". The interpretation is already known as the Carnapian extension of S5. A new axiomatization for C provides two insights. First, introducing an inference rule "textual substitution" allows seamless integration of the propositional and modal parts of the logic, giving a more practical system for writing formal proofs. Second, the two following approaches to axiomatizing a logic are shown to be not equivalent: (i) give axiom schemes that denote an infinite number of axioms and (ii) write a finite number of axioms in terms of propositional variables and introduce a substitution inference rule. |
| URI: | http://hdl.handle.net/1813/7239 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|