Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 2000: Computer Science Logic pp 1–17Cite as

Background, Reserve, and Gandy Machines

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1862))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andreas Blass, Yuri Gurevich and Saharon Shelah, “Choiceless Polynomial Time”, Annals of Pure and Applied Logic 100 (1999), 141–187.

    Article  MATH  MathSciNet  Google Scholar 

  2. Herbert B. Enderton, “A Mathematical Introduction to Logic,” Academic Press.

    Google Scholar 

  3. Robin Gandy, “Church’s thesis and principles for mechanisms” in: “The Kleene Symposium” (ed. J. Barwise et al.), North-Holland, 1980, 123–148.

    Google Scholar 

  4. “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.

    Google Scholar 

  5. Yuri Gurevich, “Evolving Algebra 1993: Lipari Guide”, in “Specification and Validation Methods”, Ed. E. Boerger, Oxford University Press, 1995, 9–36.

    Google Scholar 

  6. Yuri Gurevich, “Sequential Abstract State Machines Capture Sequential Algorithms”, ACM Transactions on Computational Logic 1, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Dept., University of Michigan, Ann Arbor, MI, 48109-1109, USA

    Andreas Blass

  2. Microsoft Research, One Microsoft Way, Redmond, WA, 98052, USA

    Yuri Gurevich

Authors
  1. Andreas Blass
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Department of Biology, Boston College, Fulton Hall 410B, Chestnut Hill, MA, 02467, USA

    Peter G. Clote

  2. Mathematisches Institut, Ludwig-Maximilian-Universität München, Theresienstr. 39, 80333, München, Germany

    Helmut Schwichtenberg

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation