Abstract
Traditional model theory (Chang and Keisler 1973, Bell and Slomson 1971), like classical predicate logic, is static in nature. Models, valuations of variables, and truth values of predicates are regarded as fixed and immutable. This tradition has surely contributed to the dominance of denotational over operational semantics in programming languages. It is somewhat ironic that first-order predicate logic is in general inadequate for handling even the most elementary and pervasive of logical constructions in computer science, namely induction. For this reason, and for its general lack of programmability, one might argue that the emphasis on first-order predicate logic in the undergraduate computer science curriculum may be detrimental to the development of sound algorithmic reasoning.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kozen, D. (2002). Some Results in Dynamic Model Theory. In: Boiten, E.A., Möller, B. (eds) Mathematics of Program Construction. MPC 2002. Lecture Notes in Computer Science, vol 2386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45442-X_2
Download citation
DOI: https://doi.org/10.1007/3-540-45442-X_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43857-1
Online ISBN: 978-3-540-45442-7
eBook Packages: Springer Book Archive