Proof Nets for Lambek Calculus

DOI10.1093/logcom/2.2.211zbMath0768.03035OpenAlexW2060132857MaRDI QIDQ4013256

Dirk Roorda

Publication date: 27 September 1992

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/2.2.211

zbMATH Keywords

parallelismlinear logicalgorithms for automatic theorem provingnon-commutative Lambek calculusnonlinear proof representationproof nets as data structures

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Structure of proofs (03F07)

Related Items (7)

Interpolation in fragments of classical linear logic ⋮ Lambek vs. Lambek: functorial vector space semantics and string diagrams for Lambek calculus ⋮ Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing ⋮ A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic ⋮ A new correctness criterion for the proof nets of non-commutative multiplicative linear logics ⋮ Proof nets for multiplicative cyclic linear logic and Lambek calculus ⋮ Pomset Logic

This page was built for publication: Proof Nets for Lambek Calculus