𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A quantifier elimination for the theory of p-adic numbers

✍ Scribed by L. Egidi

Publisher
Springer
Year
1998
Tongue
English
Weight
651 KB
Volume
7
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

How to Eliminate Quantifiers in the Elem
How to Eliminate Quantifiers in the Elementary Theory of p-Rings
✍ Burkhard Molzan πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 543 KB

HOW TO ELIMINATE QUANTIFIERS IN THE ELEMENTARY THEORY OF p-RINGS by BUREHARD MOLZAN in Berlin (G.D.R.)l) 0. Int,roduction Let p be an arbitrary prime. By a p-ring we understand a commutative ring with unit, any element of which satisfies XP = x and px =df x + . . . + x = 0. Let p times LR = (+, \*,

Quantifier elimination for the theory of
Quantifier elimination for the theory of algebraically closed valued fields with analytic structure
✍ YalΔ±n F. Γ‡elikler πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 177 KB

## Abstract The theory of algebraically closed non‐Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz, and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this pape

A p-adic algorithm for computing the inv
A p-adic algorithm for computing the inverse of integer matrices
✍ H. Haramoto; M. Matsumoto πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 270 KB

A method for computing the inverse of an (n Γ— n) integer matrix A using p-adic approximation is given. The method is similar to Dixon's algorithm, but ours has a quadratic convergence rate. The complexity of this algorithm (without using FFT or fast matrix multiplication) is O(n 4 (log n) 2 ), the s