Learning First Order Quantifier Denotations An Essay in Semantic Learnability

This paper addresses the problem of how a learner would associate a denotation with a determiner on the basis of the pairing of a simple sentence with some perceptual input. Following work by van Benthem (1985), first order quantification is simulated with (a subclass of) finite state automata. Results from Angluin (1988) are used to demonstrate the learnability of this class.