Proof Mining - Mathematics, Algorithms and Proofs
Proof Mining - Mathematics, Algorithms and Proofs
Proof Mining - Mathematics, Algorithms and Proofs
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
⎧<br />
⎪⎨<br />
⎪⎩<br />
<strong>Proof</strong> <strong>Mining</strong><br />
Let y ∈ K be the unique root of f(x, ·), yε an approximate<br />
root |f(x, yε)| < ε. Then dK(y, y Φ(x,ε)) < ε).<br />
THEOREM 2 (K.,93)<br />
For T = BA+HBC(+SEC − ) as before<br />
T ⊢ ∀x ∈ X∃!y ∈ K(F (x, y) =IR 0)<br />
∃ BA(+iter.)-definable computable function G : X → K s.t.<br />
BA(+IA) ⊢ ∀x ∈ X(F (x, G(x)) =IR 0)<br />
(X, K are BA-definable Polish spaces, K compact,<br />
F : X × K → IR BA-definable function).<br />
Ulrich Kohlenbach 21