Abstract
This paper presents the contents of a talk given in December 1990, during the second “Journées sur les Arithmétiques Faibles” held at the LITP, Paris; the talk was repeated during the 1991 Ecole de Printemps of Méjannes le Clap. The paper proves a polynomial time computability result for a class of NP inter co-NP problems, for which only the obvious exponential time algorithm was known. The result is proved by a striking use of non-standard methods, and it is not clear at all how to obtain it by standard methods.
Similar content being viewed by others
References
S. Boughattas, L'Arithmétique ouverte et ses modèles non standards, Thèse de 3° cycle, Paris VII (1987).
S. Boughattas, L'Arithmétique ouverte et ses modèles non standards, CRAS (1988).
S. Boughattas, L'Arithmétique ouverte et ses modèles non standards, J. Symb. Log.
S. Boughattas, Résultats positifs et négatifs sur l'existence d'une partie entière dans les corps ordonnés, CRAS (1991).
S. Boughattas, Modèles exotiques de l'Arithmétique ouverte avec exponnentielle, in preparation.
A. Kaplansky, Duke J. Math. 9(1942)303–321.
M.H. Mourgues and J.P. Ressayre, Every RC field has an integer part, CRAS (1991), and to appear inProc. 1990 ASL Conf. Helsinki, ed. Väänänen.
M.H. Mourgues and J.P. Ressayre, An application of Malcev's series to polynomial time computability,Proc. 1st Soviet-French Colloq. on Model Theory, Karaganda (1990).
J.P. Ressayre, Every exponential real closed field has an integer part closed under exponential,3° Journées sur les Arithémetiques Faibles (Clermont Ferrandm 1991).
J.C. Shepherdson, A nonstandard model for a free variable fragment of number theory, Bull. Ac. Pol. Sci. 12(1969)79–86.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ressayre, J.P. Polynomial time uniformization and non-standard methods. Ann Math Artif Intell 16, 75–88 (1996). https://doi.org/10.1007/BF02127795
Issue Date:
DOI: https://doi.org/10.1007/BF02127795