Abstract Control Structures and the Semantics of Quantifiers

  title={Abstract Control Structures and the Semantics of Quantifiers},
  author={S. Cushing},
Intuitively, a quantifier is any word or phrase that expresses a meaning that answers one of the questions "How many?" or "How much?" Typical English examples include all, no, many, few, some but not many, all but at most a very few, wherever, whoever, whoever there is, and also, it can be arguesd, only (Keenan, 1971), also (Cushing, 1978b), and the (Chomsky, 1977), In this paper we review an empirically motivated analysis of such meanings (Cushing, 1976; 1982a) and draw out its computational… Expand

Figures from this paper

Some Quantifiers Require Two-Predicate Scopes
  • S. Cushing
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1987
Abstract Predicate calculus has long served as the basis of mathematical logic and has more recently achieved widespread use in artificial intelligence. This system of logic expresses propositions inExpand
“Minds and machines” for humanities majors: A liberal arts course in computers and cognition
A new one-semester course is described in which undergraduate students in non-technical majors are shown how traditional philosophical problems of knowledge, cognition, language, and human nature canExpand
A PARLOG Implementation of Government-Binding Theory
The purpose of this paper is to report on research on a parallel parser based on the principles and constraints of Government-Binding Theory, a linguistics tool for exploring concurrency and autonomy among modules of the theory. Expand


Dynamic Model Selection in the Interpretation of Discourse
It is argued that a selection account of discourse interpretation falls right out of the relativized rule, along with an explanation for at least some “conventional implicatures” (Karttunen and Peters, 1979). Expand
A rigorous framework for studying immutable data types having nondeterministic operations and operations exhibiting exceptional behavior is developed. The framework embodies the view of a data typeExpand
PRUF - A Language for the Representation of Meaning in Natural Languages
PRUF--an acronym for Possibilistic Relational Universal Fuzzy--is a designation for a novel type of synthetic language which is intended to serve as a target language for the representation ofExpand
And/Or Programs: A New Approach to Structured Programming
A simple tree-like programming/specification language is presented. The central idea is the dividing of conventional programming constructs into the two classes of and and or subgoaling, the subgoalExpand
The relationship between design and verification
If a system design process inherently produces a design that no longer requires certain types of ''after the fact'' verification, many aspects previously associated with the verification process can be eliminated. Expand
Formal semantics and logic
The Bivalence Birkhoff-Birkhoff Algorithm simplifies Euclidean reversing Alphabetic variant Alphabetical order and proves the existence of a new type of Boolean algebra called Bound variable Branch. Expand
The future of programming
This paper surveys the most likely changes in the programming task and in the nature of software over the short term, the medium term, and the long term. Expand
The functional life cycle model and its automation: USE.IT
This thesis discusses the HOS functional model, USE.IT, which provides for an integrated and automated development process of a system and the implications of their use. Expand
now I wonder if this is any longer necessary. Suddenly it seems that the whole nation is aware of something new-that a big change is taking place in our economy-that a new industrial age has arrivedExpand
Higher Order Software—A Methodology for Defining Software
The formal methodology of Higher Order Software (HOS), specifically aimed toward large-scale multiprogrammed/multiprocessor systems, is dedicated to systems reliability. Expand