Cut Elimination In Noncommutative Substructural Logics

Reports on Mathematical Logic:13-29 (1996)
  Copy   BIBTEX

Abstract

The present paper is concerned with the cut eliminability for some sequent systems of noncommutative substructural logics, i.e. substructural logics without exchange rule. Sequent systems of several extensions of noncommutative logics FL and LBB'I, which is sometimes called $\tw$, will be introduced. Then, the cut elimination theorem and the decision problem for them will be discussed in comparison with their commutative extensions.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,574

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2015-02-12

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

Hiroakira Ono
Japan Advanced Institute of Science and Technology

References found in this work

No references found.

Add more references