𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Completeness and cut-elimination theorems for trilattice logics

✍ Scribed by Norihiro Kamide; Heinrich Wansing

Book ID
108054696
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
347 KB
Volume
162
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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