Back to Results
First PageMeta Content
Science / Automata theory / Quantification / Models of computation / Formal languages / Generalized quantifier / Pushdown automaton / Cognitive science / Finite-state machine / Logic / Mathematical logic / Semantics


Automata and Complexity in Multiple-Quantifier Sentence Verification Jakub Szymanik ([removed]) Institute for Logic, Language and Computation, University of Amsterdam Shane Steinert-Threlkeld (Shanest@stanford.
Add to Reading List

Document Date: 2013-05-20 06:27:06


Open Document

File Size: 257,67 KB

Share Result on Facebook

City

San Francisco / Amsterdam / Johnson-Laird / Oxford / /

Company

Attentional Networks / Harvard University Press / Clarendon Press / /

/

Facility

University of Amsterdam / National Science Centre / University of Warsaw / University of Amsterdam Shane Steinert-Threlkeld / /

IndustryTerm

basic tools / latter network / control network / precise processing predictions / can stop processing / /

MusicGroup

M. I. / /

Organization

Lecture Notes In Artificial Intelligence / Harvard University / University of Warsaw / Institute for Logic / Language and Computation / University of Amsterdam / Stanford University / Department of Philosophy / National Science Centre in Poland / Faculty of Psychology / /

Person

Thomas F. Icard III / Every / Van Benthem / Veni Grant / Lawrence Erlbaum / Shane Steinert-Threlkeld / /

Position

mean RT / poet / RT / automata model for simple quantifier sentences / model / /

ProvinceOrState

P. N. / /

PublishedMedium

Journal of Cognitive Neuroscience / /

Technology

Neuroscience / control network / same algorithm / PDA / /

SocialTag