Semantic Automata

  • Johan Van Benthem
Part of the Studies in Linguistics and Philosophy book series (SLAP, volume 29)


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.


Finite State Machine Regular Language Finite State Automaton Procedural Semantic Machine Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© D. Reidel Publishing Company 1986

Authors and Affiliations

  • Johan Van Benthem
    • 1
  1. 1.Mathematics InstituteUniversity of AmsterdamThe Netherlands

Personalised recommendations