Combinators and structurally free logic
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
semanticscompleteness theoremsubstructural logicsrelevance logiccombinatory logicGentzen systemcut theoremnon-associative Lambek calculusgagglecombinatory posetframes with a ternary accessibility relation
Other algebras related to logic (03G25) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof theory in general (including proof-theoretic semantics) (03F03) Combinatory logic and lambda calculus (03B40)
Related Items (24)
This page was built for publication: Combinators and structurally free logic