Strong extension axioms and Shelah's zero-one law for choiceless polynomial time

Journal of Symbolic Logic 68 (1):65-131 (2003)
This paper developed from Shelah's proof of a zero-one law for the complexity class "choice-less polynomial time." defined by Shelah and the authors. We present a detailed proof of Shelah's result for graphs, and describe the extent of its generalizability to other sorts of structures. The extension axioms, which form the basis for earlier zero-one laws (for first-order logic, fixed-point logic, and finite-variable infinitary logic) are inadequate in the case of choiceless polynomial time; they must be replaced by what we call the strong extension axioms. We present an extensive discussion of these axioms and their role both in the zero-one law and in general
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1045861507
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,793
Through your library
References found in this work BETA
Choiceless Polynomial Time.Andreas Blass, Yuri Gurevich & Saharon Shelah - 1999 - Annals of Pure and Applied Logic 100 (1-3):141-187.

Add more references

Citations of this work BETA
Symbioses Between Mathematical Logic and Computer Science.Andreas Blass - 2016 - Annals of Pure and Applied Logic 167 (10):868-878.

Add more citations

Similar books and articles
Added to PP index

Total downloads
15 ( #349,993 of 2,214,726 )

Recent downloads (6 months)
2 ( #239,248 of 2,214,726 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature