Two extensions of the structurally free logic LC

DOI10.1093/JIGPAL/6.3.403zbMath0904.03006OpenAlexW2034977973MaRDI QIDQ4392658

Katalin Bimbó, J. Michael Dunn

Publication date: 1998

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/6.3.403

zbMATH Keywords

representation theoremcut eliminationalgebraic semanticssubstructural logiccombinatorsGentzen systemframe semanticssingle-conclusion sequent system

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40)

Related Items (8)

Combinatory logic and the semantics of substructural logics ⋮ Symmetric generalized Galois logics ⋮ \(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofs ⋮ A cut-elimination proof in positive relevant logic with necessity ⋮ The Church-Rosser property in dual combinatory logic ⋮ Australasian Association for Logic 1999 Annual Conference Co-Sponsored by The Association for Symbolic Logic ⋮ Admissibility of cut in LC with fixed point combinator ⋮ Relational semantics for Kleene logic and action logic

This page was built for publication: Two extensions of the structurally free logic LC