Abstract State Machines and Pure Mathematics

  • Andreas Blass
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1912)


We discuss connections, similarities, and differences between the concepts and issues arising in the study of abstract state machines and those arising in pure mathematics, particularly in set theory and logic. Among the topics from pure mathematics are the foundational role of set theory, permutation models of set theory without the axiom of choice, and interpretations (between theories or vocabularies) regarded as transformations acting on structures.


Boolean Function Isomorphism Class Function Symbol Pure Mathematic Arbitrary Choice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andreas Blass and Yuri Gurevich, “Existential fixed-point logic”, in Computation Theory and Logic, ed. by E. Börger, Lecture Notes in Computer Science 270, Springer-Verlag (1987) 20–36.CrossRefGoogle Scholar
  2. 2.
    Andreas Blass, Yuri Gurevich, and Saharon Shelah, “Choiceless polynomial time”, Ann. Pure Appl. Logic, 100 (1999) 141–187.MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Andreas Blass, Yuri Gurevich, and Jan Van den Bussche, “Abstract state machines and computationally complete query languages”, this volume.Google Scholar
  4. 4.
    Nicolas Bourbaki, Elements of Mathematics. Theory of Sets, Hermann (1968).Google Scholar
  5. 5.
    Abraham Fraenkel, Der Begriff “definit” und die Unabhängigkeit des Aus-wahlaxioms, Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-Mathematische Klasse (1922) 253–257.Google Scholar
  6. 6.
    Murdoch J. Gabbay and Andrew M. Pitts, “A New Approach to Abstract Syn-tax Involving Binders”, in Proceedings 14th Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 1999, IEEE Computer Society Press (1999) 214–224.Google Scholar
  7. 7.
    Yuri Gurevich, “Evolving Algebra 1993: Lipari Guide”, in Specification and Vali-dation Methods, ed. by E. Boerger, Oxford University Press, 1995, 9–36.Google Scholar
  8. 8.
    Yuri Gurevich, “Sequential abstract state machines capture sequential algorithms”, ACM Transactions on Computational Logic, to appear.Google Scholar
  9. 9.
    Thomas Jech, The Axiom of Choice, North-Holland (1973).Google Scholar
  10. 10.
    F. William Lawvere, “Variable quantities and variable structures in topoi”, in Algebra, Topology, and Category Theory (A Collection of Papers in Honor of Samuel Eilenberg), ed. by A. Heller and M. Tierney, Academic Press (1976) 101–131.Google Scholar
  11. 11.
    Eugene C. Luschei, The Logical Systems of Leśniewski, North-Holland (1962).Google Scholar
  12. 12.
    Anthony P. Morse, A Theory of Sets, Academic Press (1965).Google Scholar
  13. 13.
    Anand Pillay, Geometric Stability Theory, Oxford University Press (1996).Google Scholar
  14. 14.
    Saharon Shelah, Choiceless polynomial time logic: Inability to express, paper number 634, to appear.Google Scholar
  15. 15.
    Joseph Shoenfield, Mathematical Logic, Addison-Wesley (1967).Google Scholar
  16. 16.
    Edward E. Slaminka, “A Brouwer translation theorem for free homeomorphisms”, Trans. Amer. Math. Soc., 306 (1988) 277–291.MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Alfred Tarski, Andrzej Mostowski, and Abraham Robinson, Undecidable Theories, North-Holland (1953).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Andreas Blass
    • 1
  1. 1.University of MichiganUSA

Personalised recommendations