| 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. |
[an error occurred while processing this directive]
URL:
http://web.eecs.umich.edu/gasm/papers/strong01.html (page only)
last update: Wednesday, 14-Aug-2013 18:19:19 EDT