Hochschulschrift
On the extraction of computational content from noneffective convergence proofs in analysis
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783832537654
3832537651
- Maße
-
21 cm
- Umfang
-
VI, 150 S.
- Sprache
-
Englisch
- Anmerkungen
-
Zugl.: Darmstadt, Techn. Univ., Diss., 2014
- Schlagwort
-
Beweistheorie
Berechenbarkeit
Analysis
Konvergenz
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:02 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Safarik, Pavol
- Logos-Verl.
Entstanden
- 2014
Ähnliche Objekte (12)
Refinement of Classical Proofs for Program Extraction
On the constructive content of proofs
On the constructive content of proofs
Analysis of methods for extraction of programs from non-constructive proofs
Content extraction : identifying the main content in HTML documents
Program extraction from coinductive proofs and its application to exact real arithmetic
Reusing Proofs
Computable Short Proofs
Generating Multilingual Proofs
Proofs and "Puzzles"
Proofs and Provability
Proofs and "Puzzles"
Refinement of Classical Proofs for Program Extraction
On the constructive content of proofs
On the constructive content of proofs
Analysis of methods for extraction of programs from non-constructive proofs
Content extraction : identifying the main content in HTML documents
Program extraction from coinductive proofs and its application to exact real arithmetic
Reusing Proofs
Computable Short Proofs
Generating Multilingual Proofs
Proofs and "Puzzles"
Proofs and Provability
Proofs and "Puzzles"
Refinement of Classical Proofs for Program Extraction
On the constructive content of proofs
On the constructive content of proofs
Analysis of methods for extraction of programs from non-constructive proofs
Content extraction : identifying the main content in HTML documents
Program extraction from coinductive proofs and its application to exact real arithmetic
Reusing Proofs
Computable Short Proofs
Generating Multilingual Proofs
Proofs and "Puzzles"
Proofs and Provability