Combinators and structurally free logic

From MaRDI portal
Revision as of 22:55, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4353718

DOI10.1093/jigpal/5.4.505zbMath0878.03008OpenAlexW2153111627MaRDI QIDQ4353718

Robert K. Meyer, J. Michael Dunn

Publication date: 15 December 1997

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

Full work available at URL: https://semanticscholar.org/paper/b32acbbe0ae7d5b68510fbd5cf2a5cdfd8d12823




Related Items (24)

Current trends in substructural logicsAustralasian Association for Logic 1997 Annual ConferenceIN MEMORIAM: J. MICHAEL DUNN, 1941–2021Combinatory logic and the semantics of substructural logicsThe Relevance of Relevance to Relevance LogicOn structural features of the implication fragment of Frege's \textit{Grundgesetze}Symmetric generalized Galois logicsOn the ternary relation and conditionality\(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofsManipulating Sources of Information: Towards an Interpretation of Linear Logic and Strong Relevance LogicTracking InformationA “Reply” to My “Critics”The Church-Rosser property in symmetric combinatory logicOn the decidability of implicational ticket entailmentNew consecution calculi for \(R^{t}_{\to}\)Extracting \(\mathsf{BB'IW}\) inhabitants of simple types from proofs in the sequent calculus \(LT_\to^t\) for implicational ticket entailmentLambek calculus with conjugatesThe Church-Rosser property in dual combinatory logicSemantics for dual and symmetric combinatory calculi1998 Spring Meeting of the Association for Symbolic LogicArrows Pointing at Arrows: Arrow Logic, Relevance Logic, and Relation AlgebrasAustralasian Association for Logic 1999 Annual Conference Co-Sponsored by The Association for Symbolic LogicAdmissibility of cut in LC with fixed point combinatorRelational semantics for Kleene logic and action logic






This page was built for publication: Combinators and structurally free logic