Lexicalized proof-nets and TAGs

DOI10.1007/3-540-45738-0_14MaRDI QIDQ2763023zbMATH OpenFDO

Authors Sylvain Pogodalla

Publication date 14 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45738-0_14

zbMATH Keywords

generative powerlinear logic proof-netspomset linear logictree-adjoining grammars

Mathematics Subject Classification ID

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

Recommendations

• Tree adjoining grammars in noncommutative linear logic
• scientific article; zbMATH DE number 1406013
• Labelled proof nets for the syntax and semantics of natural languages
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• Pomset logic. The other approach to noncommutativity in logic

Cited in

(7)

• An LTAG perspective on categorial inference
• Partial proof trees, resource sensitive logics and syntactic constraints
• Tree adjoining grammars in noncommutative linear logic
• Labelled proof nets for the syntax and semantics of natural languages
• scientific article; zbMATH DE number 1406013 (Why is no real title available?)
• scientific article; zbMATH DE number 1421191 (Why is no real title available?)
• Pomset logic. The other approach to noncommutativity in logic

This page was built for publication: Lexicalized proof-nets and TAGs

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