| H. Zimmermann. A Directed Tree Calculus for Minimal Tense Logic. Master's Thesis, Institute for Applied Mathematics and Computer Science, University of Bern, Switzerland, 1995. |
.... and Hudelmaier [8] In the presentation of the modal propositional logics and of provability logic we follow Fitting [4, 5] and Boolos [2] Our approach to multimodal logics is similar to the presentation in Halpern and Moses [6] Tense logics are implemented via a calculus developed by Zimmermann [14], which is based on Rescher and Urquhart [10] In the case of linear logic we follow Andreoli [1] and Tammet [13] Decision Procedures: All decision procedures for monotonic systems, which are implemented so far, are based on sequent calculi. We took the standard forms of these systems and ....
Heinrich Zimmermann. A directed tree calculus for minimal tense logic. Master's thesis, IAM, University of Bern, Switzerland, 1994. This article was processed using the L a T E X macro package with LLNCS style
....used in the nite search for a world, for which one of the other rules or the axiom schema matches. If no such world exists, then proof search ends with fail. Theorem 30. K t H A , K t G j A , K t GU j A A syntactical proof of the equivalence of K t H and K t GU is given in [16]. Example 7. In a backward proof search in K t G for the formula P P we run into an endless loop. JUMP1) P j P XX Xz P j P : P; P; P; P P j P ( JUMP2) P j P XX Xz j P; P : P; P; P; P P j ( JUMP1) P j P ....
Heinrich Zimmermann. A directed tree calculus for minimal tense logic. Master's thesis, IAM, University of Berne, Switzerland, 1995. This article was processed using the L a T E X macro package with LLNCS style
No context found.
H. Zimmermann. A Directed Tree Calculus for Minimal Tense Logic. Master's Thesis, Institute for Applied Mathematics and Computer Science, University of Bern, Switzerland, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC