Undecidability of the first-order arithmetic A[P(x), 2x, x + 1]
โ Scribed by Hiroakira Ono; Akira Nakamura
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 590 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper continues the investigation of the arithmetic of the curves C A : y 2 =x a +A and their Jacobians J A , where a is an odd prime and A is an integer not divisible by a, which was begun in an earlier paper. In the first part, we sketch how to extend the formula for the dimension of a certai
We obtain the asymptotic formulae |B & V| =( |B|รp)+O(-|B| log 2 p) for the number of solutions of the congruence x 1 x 2 #x 3 x 4 (mod p) in a box B of arbitrary size and position, and N(B)=(12ร? 2 ) B 2 log B+CB 2 +O(B 19ร13 log 7ร13 B), with C given explicitly, for the number of solutions of the
Polyclonal antisera generated to peptides corresponding to the carboxy termini of the seven cloned rat P2X receptors were compared using membranes from CHO-K1 or 1321N1 cells expressing recombinant rat or human P2X receptors (rat P2X 3 , P2X 4 , and P2X 5 and human P2X 1 , P2X 2 , P2X 6 , and P2X 7