Admissibility of cut in LC with fixed point combinator

DOI10.1007/S11225-005-4651-YzbMath1089.03012OpenAlexW2066761871MaRDI QIDQ817697

Katalin Bimbó

Publication date: 17 March 2006

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-005-4651-y

zbMATH Keywords

substructural logicsCombinatory logiccut rulefixed point combinatorstructurally free logics

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Combinatory logic and lambda calculus (03B40)

Related Items (5)

Current trends in substructural logics ⋮ RELEVANCE LOGICS AND RELATION ALGEBRAS ⋮ \(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofs ⋮ On the decidability of implicational ticket entailment ⋮ New consecution calculi for \(R^{t}_{\to}\)

Uses Software

• Pesca

Cites Work

• Combinator logics
• Semantics for structurally free logics LC+
• Combinators and structurally free logic
• Two extensions of the structurally free logic LC
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Admissibility of cut in LC with fixed point combinator