Cargando…
On the Extraction of Computational Content from Noneffective Convergence Proofs in Analysis
Annotation
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Berlin :
Logos Verlag Berlin,
2014.
|
| Temas: | |
| Acceso en línea: | Texto completo |
MARC
| LEADER | 00000cam a2200000Mu 4500 | ||
|---|---|---|---|
| 001 | EBOOKCENTRAL_on1112423462 | ||
| 003 | OCoLC | ||
| 005 | 20240329122006.0 | ||
| 006 | m o d | ||
| 007 | cr |n|---||||| | ||
| 008 | 190817s2014 gw o 000 0 eng d | ||
| 040 | |a EBLCP |b eng |e pn |c EBLCP |d YDX |d OCLCQ |d REDDC |d OCLCO |d UX1 |d OCLCF |d SFB |d OCLCO |d OCLCQ |d OCLCO | ||
| 019 | |a 1038481251 |a 1290100613 | ||
| 020 | |a 9783832591601 | ||
| 020 | |a 3832591605 | ||
| 020 | |z 9783832537654 | ||
| 020 | |z 3832537651 | ||
| 029 | 1 | |a AU@ |b 000068475697 | |
| 035 | |a (OCoLC)1112423462 |z (OCoLC)1038481251 |z (OCoLC)1290100613 | ||
| 050 | 4 | |a QA9.54 |b .S243 2014 | |
| 082 | 0 | 4 | |a 511.3 |2 23 |
| 049 | |a UAMI | ||
| 100 | 1 | |a Safarik, Pavol. | |
| 245 | 1 | 0 | |a On the Extraction of Computational Content from Noneffective Convergence Proofs in Analysis |
| 260 | |a Berlin : |b Logos Verlag Berlin, |c 2014. | ||
| 300 | |a 1 online resource (164 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Intro; 1 Preliminaries; 1.1 The System WE-HAw; 1.2 Fragments and Extensions of WE-HAw; 1.3 The ordered Field of rational Numbers within WE-HAw; 1.4 The Archimedean ordered Field of real Numbers within WE-HAw; 1.5 Kuroda's negative Translation; 1.6 Gödel's Functional Interpretation; 1.7 Majorizability; 1.8 Monotone Functional Interpretation; 1.9 A specific metatheorem; 1.10 Models of E-PAw; 1.11 Bar Recursion; 1.12 Law of excluded Middle; 1.13 Double Negation Shift; 1.14 Axiom of Choice; 1.15 Arithmetical Comprehension; 1.16 Weak König's Lemma; 1.17 Complexity classes and bar recursion | |
| 505 | 8 | |a 2 Effective learnability2.1 Fluctuations versus effective learnability; 2.2 Cauchy statements and unrestricted use of S01-LEM; 2.3 Which Cauchy statements are effectively learnable and which are not; 2.4 When learnability implies fluctuation bounds; 3 Interpreting a strong non-linear ergodic theorem; 3.1 Arithmetizing Wittmann's proof; 3.2 Obtaining a bound; 3.3 A general bound existence theorem; 3.4 Uniform bounds for Wittmann's ergodic theorems; 3.5 Proof of Proposition 3.9; 4 Interpreting Bolzano-Weierstraß; 4.1 Interpreting Bolzano-Weierstraß | |
| 505 | 8 | |a 4.2 Analysis of the Complexity of the Realizers5 Functional interpretation for IST; 5.1 Formalities; 5.2 Nonstandard principles; 5.3 A functional interpretation for E-HA; 5.4 The system E-PA and negative translation; 5.5 A functional interpretation for E-PA; 5.6 Countable saturation | |
| 520 | 8 | |a Annotation |b The Fields medalist, Terence Tao, recently emphasized the importance of ``hard'' (or finitary) analysis and connected the finitisation to the methods we will employ in this thesis: ... The main advantage of working in a finitary setting ... is that the underlying dynamical system becomes extremely explicit. ... In proof theory, this finitisation is known as Gödel functional interpretation ...For convergence theorems Tao calls the finitary formulation metastability and the corresponding explicit content its rate(s). In the case of the mean ergodic theorem such a rate can be used to obtain even an effective bound on the number of fluctuations. We introduce effective learnability and three other natural kinds of such finitary information and analyze the corresponding proof-theoretic conditions.Effective learnability not only provides means to know when to expect a bound on the number of fluctuations but also explains a very common pattern in the realizers for strong ergodic theorems. Moreover, we will see how a most natural example for a non-learnable convergence theorem closely relates to a notable exception to this pattern, the strong nonlinear ergodic theorem due to Wittmann.Finally, we show how can computational content be extracted in the context of non-standard analysis.P. Safarik, born and studied at grammar school Grösslingová in Bratislava, Diplom (ger.) and PhD in mathematics at TU Darmstadt. | |
| 504 | |a Includes bibliographical references. | ||
| 590 | |a ProQuest Ebook Central |b Ebook Central Academic Complete | ||
| 650 | 0 | |a Proof theory. | |
| 650 | 6 | |a Théorie de la preuve. | |
| 650 | 7 | |a Proof theory |2 fast | |
| 776 | 0 | 8 | |i Print version: |a Safarik, Pavol. |t On the Extraction of Computational Content from Noneffective Convergence Proofs in Analysis. |d Berlin : Logos Verlag Berlin, ©2014 |z 9783832537654 |
| 856 | 4 | 0 | |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=5850406 |z Texto completo |
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL5850406 | ||
| 938 | |a YBP Library Services |b YANK |n 15453933 | ||
| 994 | |a 92 |b IZTAP | ||