Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Proof nets and the complexity of processing center embedded constructions

From MaRDI portal
Publication:1280048
Jump to:navigation, search

DOI10.1023/A:1008386826277zbMath0915.03028OpenAlexW1581562557MaRDI QIDQ1280048

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

proof netspsycholinguisticsresource logicshuman language processingincomplete dependenciesincremental semantic interpretation


Mathematics Subject Classification ID

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


Related Items (1)

Dutch Grammar and Processing: A Case Study in TLG







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1280048&oldid=13384365"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 10:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki