Abstract State Machines


Subjects

Methodology

Applications

ASM Studies

Strong Extension Axioms and Zero-One Law


Citation: Andreas Blass and Yuri Gurevich, "Strong Extension Axioms and Shelah's Zero-One Law for Choiceless Polynomial Time", Microsoft Research Technical Report MSR-TR-2001-68.
Summary: A detailed proof of Shelah's zero-one law for the choiceless polynomial time variant of ASMs, and a discussion of its extensibility to other sorts of structures.
Subjects: Logic & Computability
Download: From Yuri Gurevich's home page in PostScript.
Notes: See also the popular version of this paper.