The complexity of the theory of p-adic numbers

This paper addresses the question of the complexity of the decision problem for the theory Th(Q/sub p/) of p-adic numbers. The best known lower bound for the theory is double exponential alternating time with a linear number of alternations. I have designed an algorithm that determines the truth value of sentences of the theory requiring double exponential space. My algorithm is based on techniques used by G.E. Collins (1975) for the theory Th(R) of the reals, and on J. Denef's work (1986) on semi-algebraic sets and cell decomposition for p-adic fields. No elementary upper bound had been previously established.<<ETX>>

[1]  Jan Denef,et al.  p-adic semi-algebraic sets and cell decomposition. , 1986 .

[2]  N. Koblitz.  p-adic Numbers, p-adic Analysis, and Zeta-Functions , 1977 .

[3]  S. Kochen,et al.  Diophantine Problems Over Local Fields: III. Decidable Fields , 1966 .

[4]  Philip Scowcroft,et al.  On the structure of semialgebraic sets over p-adic fields , 1988, Journal of Symbolic Logic.

[5]  Markus Lauer.  Generalized p-adic Constructions , 1983, SIAM J. Comput..

[6]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[7]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[8]  Simon Kochen,et al.  DIOPHANTINE PROBLEMS OVER LOCAL FIELDS II. A COMPLETE SET OF AXIOMS FOR p-ADIC NUMBER THEORY.* , 1965 .

[9]  Paul J. Cohen,et al.  Decision procedures for real and p‐adic fields , 1969 .

[10]  E. V. Krishnamurthy,et al.  Matrix Processors Using p-adic Arithmetic for Exact Linear Computations , 1977, IEEE Transactions on Computers.

[11]  Angus Macintyre,et al.  Twenty Years of P-Adic Model Theory , 1986 .

[12]  S. Kochen,et al.  Diophantine Problems Over Local Fields I , 1965 .

[13]  Paul S. Wang.  Implementation of a p-adic Package for Polynomial Factorization and Other Related Operations , 1984, EUROSAM.

[14]  J. Cassels,et al.  Rational Quadratic Forms , 1978 .

[15]  Rüdiger Loos.  Computing Rational Zeros of Integral Polynomials by p-adic Expansion , 1983, SIAM J. Comput..

[16]  Jean-Pierre Serre.  A Course in Arithmetic , 1973 .

[17]  Angus Macintyre,et al.  On definable subsets of p-adic fields , 1976, Journal of Symbolic Logic.

[18]  Leonard Berman,et al.  The Complexity of Logical Theories , 1980, Theor. Comput. Sci..

[19]  Devdatt Padmakar Dubhashi.  Algorithmic Investigations in P-Adic Fields , 1992 .

[20]  Kenneth H. Rosen,et al.  Discrete Mathematics and its applications , 2000 .

[21]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.