𝔖 Bobbio Scriptorium
✦   LIBER   ✦

CUT ELIMINATION FOR PROPOSITIONAL DYNAMIC LOGIC WITHOUT

✍ Scribed by Robert A. Bull

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
764 KB
Volume
38
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The aim of this paper is to extend the semantic analysis of tense logic in Rescher/Urquhart [3] to propositional dynamic logic without*. For this we develop a nested sequential calculus whose axioms and rules directly reflect the steps in the semantic analysis. It is shown that this calculus, with the cut rule omitted, is complete with respect to the standard semantics. It follows that cut elimination does hold for this nested sequential calculus. MSC: 03B45.

πŸ“œ SIMILAR VOLUMES

Cut-Elimination Theorem for the Logic of
Cut-Elimination Theorem for the Logic of Constant Domains
✍ Ryo Kashima; Tatsuya Shimura πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 776 KB

## Abstract The logic CD is an intermediate logic (stronger than intuitionistic logic and weaker than classical logic) which exactly corresponds to the Kripke models with constant domains. It is known that the logic CD has a Gentzen‐type formulation called LD (which is same as LK except that (β†’) an

Cut-elimination Theorems for Some Infini
Cut-elimination Theorems for Some Infinitary Modal Logics
✍ Yoshihito Tanaka πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 189 KB

In this article, a cut-free system TLMω 1 for infinitary propositional modal logic is proposed which is complete with respect to the class of all Kripke frames. The system TLMω 1 is a kind of Gentzen style sequent calculus, but a sequent of TLMω 1 is defined as a finite tree of sequents in a standar