Hochschulschrift
Independence proofs in arithmetic theories with very weak induction
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
69 S.
- Edition
-
Als Ms. gedr.
- Language
-
Deutsch
- Notes
-
graph. Darst.;
Zugleich: Bonn, Univ., Math.-Naturwiss. Fak., Diss. 1972
- Bibliographic citation
-
Bonner mathematische Schriften ; Nr. 61
- Keyword
-
Arithmetik
Induktion
Arithmetik
Induktion
- Event
-
Veröffentlichung
- (where)
-
Bonn
- (who)
-
Math. Inst. d. Univ. Bonn
- (when)
-
1973
- Creator
-
Garro, Ibrahim
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 11:52 AM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
- Garro, Ibrahim
- Math. Inst. d. Univ. Bonn
Time of origin
- 1973
Other Objects (12)
Independence proofs in arithmetic theories with very weak induction
Independence proofs in arithmetic theories with very weak induction
Generic induction proofs
Order Independence for Iterated Weak Dominance
Order Independence for Iterated Weak Dominance
Existence proofs by induction using methods of program synthesis
An investigation of formula generalization heuristics for induction proofs
Program extraction from coinductive proofs and its application to exact real arithmetic
Encoding induction in correctness proofs of program transformations as a termination problem
Reusing Proofs
Arithmetic
Arithmetic
Independence proofs in arithmetic theories with very weak induction
Independence proofs in arithmetic theories with very weak induction
Generic induction proofs
Order Independence for Iterated Weak Dominance
Order Independence for Iterated Weak Dominance
Existence proofs by induction using methods of program synthesis
An investigation of formula generalization heuristics for induction proofs
Program extraction from coinductive proofs and its application to exact real arithmetic
Encoding induction in correctness proofs of program transformations as a termination problem
Reusing Proofs
Arithmetic
Arithmetic
Independence proofs in arithmetic theories with very weak induction
Independence proofs in arithmetic theories with very weak induction
Generic induction proofs
Order Independence for Iterated Weak Dominance
Order Independence for Iterated Weak Dominance
Existence proofs by induction using methods of program synthesis
An investigation of formula generalization heuristics for induction proofs
Program extraction from coinductive proofs and its application to exact real arithmetic
Encoding induction in correctness proofs of program transformations as a termination problem
Reusing Proofs
Arithmetic