Abstract
In section 1.3, a state was defined as a function from identifiers to the set of values {T, F}. The notion of a state is now extended to allow identifiers to be associated with other values, e.g. integers, sequences of characters, and sets. The notion of a proposition will then be generalized in two ways:
-
1.
In a proposition, an identifier may be replaced by any expression (e.g. x⩽y) that has the value T or F.
-
2.
The quantifiers E, meaning “there exists”; A, meaning “for all”; and N, meaning “number of”, are introduced. This requires an explanation of the notions of free identifier and bound identifier and a careful discussion of scope of identifiers in expressions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Gries, D. (1981). Predicates. In: The Science of Programming. Text and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-5983-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5983-1_5
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96480-5
Online ISBN: 978-1-4612-5983-1
eBook Packages: Springer Book Archive