No label defined (Q3768889)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4027447
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4027447 |
Statements
1986
0 references
models of arithmetic
0 references
Z-ring
0 references
diophantine induction
0 references
Pell's equation
0 references
exponential function
0 references
open induction
0 references
0.8219889998435974
0 references
0.7982639074325562
0 references
0.7938461899757385
0 references
0.789652407169342
0 references
[For the entire collection see Zbl 0587.00004.] The article under review is a contribution to the study of models of (fragments of) diophantine induction. Let A(a,t) be diophantine formula of the form \[ \exists x_ 1,...,x_ n\quad (p(t,q,x_ 1,...,x_ n)=0\quad and\quad x_ 1\geq t) \] which is equivalent in \(I\Delta_ 0+\exp\) to the statement ``there is \(<x,y>\) such that y is the second coordinate of the t-th solution of Pell's equation \[ X^ 2-(a^ 2- 1)Y^ 2=1''. \] Here, \(I\Delta_ 0+\exp\) is the theory of induction for formulas in the language of arithmetic 0, 1, \(+\), \(\cdot\), \(\leq\) having only bounded quantifiers of the form \(\exists x<s\), \(\forall x<s\), plus the axiom exp stating the totality of the exponential function. By work of C. Dimitracopolous and H. Gaifman, Matijasevič's theorem is provable in \(I\Delta_ 0+\exp.\) Let F be a collection of formulas which satisfy a certain technical condition which is prototypical of the formula A(a,t). Theorem. There is a model M of open induction in which the set of primes is bounded, every number greater than 1 has a prime divisor, the fraction field \b{M} of M is elementary equivalent to the rationals Q and induction holds for all formulas B in F. In particular, \(M\vDash \forall a,t A(a,t).\) Let \(R_ 0(a,t,y)\) iff ``y is the second coordinate of the t-th solution of the equation \(X^ 2-(a^ 2-1)Y^ 2=1''\), \(R_ 1(a,t,y)\) iff \(y=a^ t\), \(R_ 2(a,t,y)\) iff \(y=\left( \begin{matrix} t\\ a\end{matrix} \right)\), \(R_ 3(t,y)\) iff \(y=t!\), and for \(i<4\) let \(S_ i\) be a diophantine formula which is equivalent over \(I\Delta_ 0+\exp\) to \(R_ i\). The following striking result follows from the Theorem: The theory T cannot prove the existence of infinitely many primes, where T consists of open induction, the statement that every integer greater than 1 has a prime divisor, and axioms stating the totality of \(S_ i\), \(i<4\). In fact, a stronger but more technical result is proved. Theorem relies on a purely number theoretic result (perhaps of independent interest), whose quite involved proof involves expanding an algebraic function into descending fraction power series, applying the Kronecker-Capelli theorem, etc.
0 references