Abstract State Machines and Pure Mathematics

Authors:
Andreas Blass
Affiliations:
-
Venue:
ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
Year:
2000

Citing 4
Cited 0

Existential fixed-point logic

Computation theory and logic
Evolving algebras 1993: Lipari guide

Specification and validation methods
Sequential abstract-state machines capture sequential algorithms

ACM Transactions on Computational Logic (TOCL)
A New Approach to Abstract Syntax Involving Binders

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.