𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sequent systems for compact bilinear logic

✍ Scribed by Wojciech Buszkowski


Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
118 KB
Volume
49
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Compact Bilinear Logic (CBL), introduced by Lambek [14], arises from the multiplicative fragment of Noncommutative Linear Logic of Abrusci [1] (also called Bilinear Logic in [13]) by identifying times with par and 0 with 1. In this paper, we present two sequent systems for CBL and prove the cut‐elimination theorem for them. We also discuss a connection between cut‐elimination for CBL and the Switching Lemma from [14].


πŸ“œ SIMILAR VOLUMES


Modal sequents for normal modal logics
✍ Claudio Cerrato πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 433 KB

## Abstract We present sequent calculi for normal modal logics where modal and propositional behaviours are separated, and we prove a cut elimination theorem for the basic system K, so as completeness theorems (in the new style) both for K itself and for its most popular enrichments. MSC: 03B45, 03

New sequent calculi for Visser's Formal
✍ Katsumasa Ishii πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 128 KB

## Abstract Two cut‐free sequent calculi which are conservative extensions of Visser's Formal Propositional Logic (FPL) are introduced. These satisfy a kind of subformula property and by this property the interpolation theorem for FPL are proved. These are analogies to Aghaei‐Ardeshir's calculi for

Suboptimal control for bilinear systems
✍ Y. Q. Ying; M. Rao; Y. X. Sun πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 246 KB

Suboptimal control for bilinear systems is discussed by use of an extension of the linear-quadratic optimal control index. The design method of this bilinear suboptimal control system is presented. Its application to the moisture control of a paper-making process is given as an example. The simulati

Stabilizing controllers for discrete bil
✍ Yury Stepanenko; Xueshan Yang πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 520 KB

In this paper, we study stabilizing controllers for time varying bilinear systems. Here, the feedback function, f in our paper is for larger classes than those given in the current literature. We establish existence theorems for stabilizing bilinear systems by output feedback from a large class. The

A Sequent Calculus for Automated Reasoni
✍ Gianna Cioni; Attilio Colagrossi; Alfonso Miola πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 680 KB

In this paper the problem of reasoning on properties of mathematical objects is considered in the context of symbolic computation. Automated reasoning mechanisms are proposed as a new basic computing tool in a symbolic computation system. These mechanisms are aimed to support the semantical correctn