Proof nets and the complexity of processing center embedded constructions

DOI10.1023/A:1008386826277MaRDI QIDQ1280048zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 17 February 1999

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

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

zbMATH Keywords

human language processingincomplete dependenciesincremental semantic interpretationproof netspsycholinguisticsresource logics

Mathematics Subject Classification ID

Logic of natural languages (03B65) Structure of proofs (03F07) Linguistics (91F20)

Recommendations

• Labelled proof nets for the syntax and semantics of natural languages
• An application of proof-nets to the study of fragments of the Lambek calculus
• Proof nets for multiplicative cyclic linear logic and Lambek calculus
• scientific article; zbMATH DE number 937366
• scientific article; zbMATH DE number 1406013

Cited in

(5)

• A coding theoretic study of MLL proof nets
• Dutch Grammar and Processing: A Case Study in TLG
• Constructing different phonological bracketings from a proof net
• Conflict nets
• Labelled proof nets for the syntax and semantics of natural languages

This page was built for publication: Proof nets and the complexity of processing center embedded constructions

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