The Elimination of Maximum Cuts in Linear Logic and BCK Logic

Studia Logica 111 (3):391-429 (2023)
  Copy   BIBTEX

Abstract

In the sequent systems for exponential-free linear logic and BCK logic a procedure of elimination of maximum cuts, cuts which correspond to maximum segments from natural deduction derivations, will be presented.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,026

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2022-12-21

Downloads
27 (#899,257)

6 months
8 (#498,398)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Mirjana Borisavljević
University of Belgrade

Citations of this work

No citations found.

Add more citations

References found in this work

Gentzen's proof of normalization for natural deduction.Jan von Plato - 2008 - Bulletin of Symbolic Logic 14 (2):240-257.
Gentzen's proof of normalization for natural deduction.Jan Platvono - 2008 - Bulletin of Symbolic Logic 14 (2):240-257.
The undecidability of k-provability.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
A proof of Gentzen's Hauptsatz without multicut.Jan von Plato - 2001 - Archive for Mathematical Logic 40 (1):9-18.

View all 16 references / Add more references