Admissibility of cut in LC with fixed point combinator

DOI10.1007/S11225-005-4651-YzbMATH Open1089.03012OpenAlexW2066761871MaRDI QIDQ817697FDOQ817697

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 logicscut ruleCombinatory logicfixed 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)

Cites Work

• Title not available (Why is that?)
• Semantics for structurally free logics LC+
• Title not available (Why is that?)
• Combinators and structurally free logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinator logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two extensions of the structurally free logic LC

Cited In (5)

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

Uses Software

• Pesca

   Recommendations

• On structure and extensionality of fixed-point combinators in CL\(w\) 👍 👎
• Two extensions of the structurally free logic LC 👍 👎
• Non-existent Statman's double fixed point combinator does not exist, indeed 👍 👎
• Combinators and structurally free logic 👍 👎
• An untyped higher order logic with Y combinator 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817697)