Abstract
The Eindhoven quantifier notation is systematic, unlike standard mathematicial notation. This has the major advantage that calculations with quantified expressions become more straightforward because the calculational rules need be given just once for a great variety of different quantifiers.
We demonstrate the ease of calculation with finite quantifications by considering a number of examples. Two are simple warm-up exercises, using boolean equality as the quantifier. Three are taken from books of challenging mathematical problems, and one is a problem concocted by the authors to demonstrate the techniques.
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.
References
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison Wesley Publ. Co., Reading (1989)
Dijkstra, E.W.: Guarded commands, nondeterminacy and formal derivation of programs. Commun. of ACM 18, 453–457 (1975)
Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Englewood Cliffs (1976)
Gries, D.: The Science of Programming. Springer, Heidelberg (1981)
Backhouse, R.: Program Construction and Verification. Prentice Hall, Englewood Cliffs (1986)
Knuth, D.E.: The Art of Computer Programming. In: Fundamental Algorithms, vol. I. Addison-Wesley Publ. Co., Reading (1968)
Backhouse, R.: Program Construction. Calculating Implementations From Specifications. John Wiley & Sons, Chichester (2003)
Zeitz, P.: The Art and Craft of Problem Solving. John Wiley & Sons, Chichester (1999)
Savchev, S., Andreescu, T.: Mathematical Miniatures. Anneli Lax New Mathematical Library, vol. 43. Math. Assoc. of America (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Backhouse, R., Michaelis, D. (2006). Exercises in Quantifier Manipulation. In: Uustalu, T. (eds) Mathematics of Program Construction. MPC 2006. Lecture Notes in Computer Science, vol 4014. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11783596_7
Download citation
DOI: https://doi.org/10.1007/11783596_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35631-8
Online ISBN: 978-3-540-35632-5
eBook Packages: Computer ScienceComputer Science (R0)