Abstract
The reserve of a state of an abstract state machine was defined to be a “naked set”. In applications, it may be convenient to have tuples, sets, lists, arrays, etc. defined ahead of time on all elements, including the reserve elements. We generalize the notion of reserve appropriately. As an application, we solve a foundational problem in Gandy’s formalization of mechanical devices.
Preparation of this paper was partially supported by a grant from Microsoft Corporation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Andreas Blass, Yuri Gurevich and Saharon Shelah, “Choiceless Polynomial Time”, Annals of Pure and Applied Logic 100 (1999), 141–187.
Herbert B. Enderton, “A Mathematical Introduction to Logic,” Academic Press.
Robin Gandy, “Church’s thesis and principles for mechanisms” in: “The Kleene Symposium” (ed. J. Barwise et al.), North-Holland, 1980, 123–148.
“Evolving Algebras: An Attempt to Discover Semantics”, Bulletin of European Assoc. for Theor. Computer Science, no. 43, Feb. 1991, 264–284. A slightly revised version appeared in G. Rozenberg and A. Salomaa, editors, “Current Trends in Theoretical Computer Science”, World Scientific, 1993, 266–292.
Yuri Gurevich, “Evolving Algebra 1993: Lipari Guide”, in “Specification and Validation Methods”, Ed. E. Boerger, Oxford University Press, 1995, 9–36.
Yuri Gurevich, “Sequential Abstract State Machines Capture Sequential Algorithms”, ACM Transactions on Computational Logic 1, to appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blass, A., Gurevich, Y. (2000). Background, Reserve, and Gandy Machines. In: Clote, P.G., Schwichtenberg, H. (eds) Computer Science Logic. CSL 2000. Lecture Notes in Computer Science, vol 1862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44622-2_1
Download citation
DOI: https://doi.org/10.1007/3-540-44622-2_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67895-3
Online ISBN: 978-3-540-44622-4
eBook Packages: Springer Book Archive