Skip to main content
SpringerLink
Log in

Choiceless Polynomial Time Computation and the Zero-One Law

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1862))

Included in the following conference series:

  • 420 Accesses

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.

Preparation of this paper was partially supported by a grant from Microsoft Corporation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  2. Andreas Blass, Yuri Gurevich, and Saharon Shelah, Choiceless polynomial time, Ann. Pure Applied Logic 100 (1999) 141–187.

    Article  MATH  MathSciNet  Google Scholar 

  3. Andreas Blass and Frank Harary, Properties of almost all graphs and complexes, J. Graph Theory 3 (1979) 225–240.

    Article  MATH  MathSciNet  Google Scholar 

  4. Béla Bollobás, Random graphs, Academic Press, 1985.

    Google Scholar 

  5. Heinz-Dieter Ebbinghaus and Jörg Flum, Finite Model Theory, Springer-Verlag (1995).

    Google Scholar 

  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. Saharon Shelah, Choiceless polynomial time logic: inability to express [paper number 634], these proceedings.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Dept., University of Michigan, Ann Arbor, MI, 48109-1109, USA

    Andreas Blass

  2. Microsoft Research, One Microsoft Way, Redmond, WA, 98052, USA

    Yuri Gurevich

Authors
  1. Andreas Blass
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuri Gurevich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Department of Biology, Boston College, Fulton Hall 410B, Chestnut Hill, MA, 02467, USA

    Peter G. Clote

  2. Mathematisches Institut, Ludwig-Maximilian-Universität München, Theresienstr. 39, 80333, München, Germany

    Helmut Schwichtenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blass, A., Gurevich, Y. (2000). Choiceless Polynomial Time Computation and the Zero-One Law. In: Clote, P.G., Schwichtenberg, H. (eds) Computer Science Logic. CSL 2000. Lecture Notes in Computer Science, vol 1862. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44622-2_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-44622-2_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67895-3

  • Online ISBN: 978-3-540-44622-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation