Skip to main content

Borne superieure de la complexite de la theorie de ℕ muni de la relation de divisibilite

  • Conference paper
  • First Online:
Model Theory and Arithmetic

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 890))

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
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

  • [FR] J. FERRANTE et C. W. RACKOFF, The Computational Complexity of Logical Theories, Lecture notes in Mathematics No 718 Springer-Verlag, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Chantal Berline Kenneth McAloon Jean-Pierre Ressayre

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Michel, P. (1981). Borne superieure de la complexite de la theorie de ℕ muni de la relation de divisibilite. In: Berline, C., McAloon, K., Ressayre, JP. (eds) Model Theory and Arithmetic. Lecture Notes in Mathematics, vol 890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0095666

Download citation

  • DOI: https://doi.org/10.1007/BFb0095666

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11159-7

  • Online ISBN: 978-3-540-38629-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics