Cut Elimination and Decidability for Classical Lambek Logic

Cut Elimination and Decidability for Classical Lambek Logic

In this article we give a cut elimination procedure for two-sided sequent system of classical Lambek logic and, on the basis of the presented procedure, a new proof of decidability for this logic.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of logic and computation 2008-02, Vol.18 (1), p.171-199
1. Verfasser: Ilic, M. I.
Format: Artikel
Sprache:eng
Schlagworte:
Classical Lambek logic
Cut-elimination theorem
Decidability
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this article we give a cut elimination procedure for two-sided sequent system of classical Lambek logic and, on the basis of the presented procedure, a new proof of decidability for this logic.
ISSN:0955-792X
1465-363X
DOI:10.1093/logcom/exm063