Proof nets and the complexity of processing center embedded constructions
type: Item
instance of: scholarly article
title: Proof nets and the complexity of processing center embedded constructions
zbMATH Open document ID: 0915.03028
DOI: 10.1023/A:1008386826277
author: K. Appert
published in: Journal of Logic, Language and Information
publication date: 1999-02-17T00:00:00Z
Mathematics Subject Classification ID: 03B65
Mathematics Subject Classification ID: 91F20
Mathematics Subject Classification ID: 03F07
zbMATH DE Number: 1251516
zbMATH Keywords: psycholinguistics
zbMATH Keywords: resource logics
zbMATH Keywords: incomplete dependencies
zbMATH Keywords: incremental semantic interpretation
zbMATH Keywords: proof nets
zbMATH Keywords: human language processing
MaRDI profile type: Publication
full work available at URL: a:1008386826277
OpenAlex ID: W1581562557
description: scientific article; zbMATH DE number 1251516