Cyclic multiplicative proof nets of linear logic with an application to language parsing

DOI10.1007/978-3-662-47709-0_5zbMATH Open1365.03039OpenAlexW1419998034MaRDI QIDQ2947459FDOQ2947459

Authors: V. Michele Abrusci, Roberto Maieli 

Publication date: 24 September 2015

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47709-0_5

Recommendations

• Cyclic multiplicative-additive proof nets of linear logic with an application to language parsing
• Proof nets for multiplicative cyclic linear logic and Lambek calculus
• A new correctness criterion for cyclic proof nets
• Parsing MELL proof nets
• Lambek's syntactic calculus and noncommutative variants of linear logic: laws and proof-nets

zbMATH Keywords

linear logicproof netssequent calculusLambek calculuscategorial grammarscyclic ordersnon-commutative logiclanguage parsing

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic of natural languages (03B65) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Natural language processing (68T50)

Cites Work

• Linear logic
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• The Mathematics of Sentence Structure
• Proof nets for the multimodal Lambek calculus
• Proof Nets for Lambek Calculus
• The structure of multiplicatives
• A semantic characterisation of the correctness of a proof net
• Title not available (Why is that?)
• Proof nets for unit-free multiplicative-additive linear logic
• Non-commutative logic. I: The multiplicative fragment
• Title not available (Why is that?)
• The blind spot. Course in logic. I. On the perfection
• Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
• A new correctness criterion for multiplicative non-commutative proof nets
• Classical conservative extensions of Lambek calculus

Cited In (6)

• Parsing MELL proof nets
• Cyclic multiplicative-additive proof nets of linear logic with an application to language parsing
• Proof nets for multiplicative cyclic linear logic and Lambek calculus
• Abstract categorial parsing as linear logic programming
• Title not available (Why is that?)
• Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic

This page was built for publication: Cyclic multiplicative proof nets of linear logic with an application to language parsing

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