Keywords
- Lecture Note
- Computational Complexity
- Mathematical Logic
- Logical Theory
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.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
