From proof trees in Lambek calculus to Ajdukiewicz Bar-Hillel elimination binary trees

DOI10.1023/A:1024647725258zbMath1074.68029OpenAlexW89575868MaRDI QIDQ1768795

Yannick Le Nir

Publication date: 15 March 2005

Published in: Research on Language and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024647725258

zbMATH Keywords

tree transformationsLambek calculuslogiccategorial grammarsproof treesAB calculus

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

This page was built for publication: From proof trees in Lambek calculus to Ajdukiewicz Bar-Hillel elimination binary trees