Abstract
An attractive, but never very central idea in modern semantics has been to regard linguistic expressions as denoting certain ‘procedures’ performed within models for the language. For instance, truth tables for propositional connectives may be viewed as computational instructions for finding truth values. Another example is the proposal in Suppes (1982) to correlate certain adjectives with procedures for locating an individual in some underlying comparative order. And finally, the frequent proposals in a more computer-oriented setting for translating from natural language into programming languages are congenial too. In this chapter, this perspective will be applied to determiners, or more in particular, quantifier expressions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 D. Reidel Publishing Company
About this chapter
Cite this chapter
Van Benthem, J. (1986). Semantic Automata. In: Essays in Logical Semantics. Studies in Linguistics and Philosophy, vol 29. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-4540-1_8
Download citation
DOI: https://doi.org/10.1007/978-94-009-4540-1_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-277-2092-4
Online ISBN: 978-94-009-4540-1
eBook Packages: Springer Book Archive