Advertisement

Choiceless Polynomial Time Computation and the Zero-One Law

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

Abstract

This paper is a sequel to [2], a commentary on [7], and an abridged version of a planned paper that will contain complete proofs of all the results presented here.

Keywords

Active Element Turing Machine Free Variable Function Symbol Input Graph 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Andreas Blass, Yuri Gurevich, and Dexter Kozen, A zero-one law for logic with a fixed-point operator, Information and Control 67 (1985) 70–90.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Andreas Blass, Yuri Gurevich, and Saharon Shelah, Choiceless polynomial time, Ann. Pure Applied Logic 100 (1999) 141–187.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Andreas Blass and Frank Harary, Properties of almost all graphs and complexes, J. Graph Theory 3 (1979) 225–240.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Béla Bollobás, Random graphs, Academic Press, 1985.Google Scholar
  5. 5.
    Heinz-Dieter Ebbinghaus and Jörg Flum, Finite Model Theory, Springer-Verlag (1995).Google Scholar
  6. 6.
    Yuri Gurevich, Evolving algebras 1993: Lipari guide, in Specification and Validation Methods, ed. E. Börger, Oxford University Press (1995) pp. 9–36. See also the May 1997 draft of the ASM guide, Tech Report CSE-TR-336-97, EECS Dept., Univ. of Michigan, 1997. Found at http://www.eecs.umich.edu/gasm/.
  7. 7.
    Saharon Shelah, Choiceless polynomial time logic: inability to express [paper number 634], these proceedings.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Andreas Blass
    • 1
  • Yuri Gurevich
    • 2
  1. 1.Mathematics Dept.University of MichiganAnn ArborUSA
  2. 2.Microsoft ResearchRedmondUSA

Personalised recommendations