Skip Navigation

The Computer Journal 1993 36(5):419-426; doi:10.1093/comjnl/36.5.419
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dubhashi, D. P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Quantifier Elimination in p-adic Fields

D. P. Dubhashi *

Max-Planck-Institut fur Informatik, Im Stadtwald, W6600 Saarbrucken, Germany

We present a tutorial survey of quantifier elimination and decision procedures in p-adic fields. The p-adic fields are studied in the (so-called) Pn-formalism of Angus Macintyre, for which motivation is provided through a rich body of analogies with real-closed fields. Quantifier elimination and decision procedures are described proceeding via a Cylindrical Algebraic Decomposition of affine p-adic space. Effective complexity analyses are also provided.

Received January 1993. revised April 1993.

* Max-Planck-Institut für Informatik, Im Stadtwald, W6600 Saarbrücken, Germany


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.