- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
30 cm
- Extent
-
69 S.
- Language
-
Deutsch
- Notes
-
Literaturverz. S. 67 - 69
- Bibliographic citation
-
Interner Bericht / Universität Karlsruhe (TH) ; Nr. 87,6
- Event
-
Veröffentlichung
- (where)
-
Karlsruhe
- (who)
-
Univ., Fak. für Informatik
- (when)
-
1987
- Creator
-
Hummel, Birgit
- 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, 12:28 PM 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.
Associated
- Hummel, Birgit
- Univ., Fak. für Informatik
Time of origin
- 1987
Other Objects (12)
Generic induction proofs
A generalization of Milnor’s formula
Independence proofs in arithmetic theories with very weak induction
Existence proofs by induction using methods of program synthesis
Independence proofs in arithmetic theories with very weak induction
Independence proofs in arithmetic theories with very weak induction
Generalization of the Macdonald formula for Hall-Littlewood polynomials
Encoding induction in correctness proofs of program transformations as a termination problem
Philosophical heuristics
Reusing Proofs
Utilitarianism and heuristics
Proofs and Provability
Generic induction proofs
A generalization of Milnor’s formula
Independence proofs in arithmetic theories with very weak induction
Existence proofs by induction using methods of program synthesis
Independence proofs in arithmetic theories with very weak induction
Independence proofs in arithmetic theories with very weak induction
Generalization of the Macdonald formula for Hall-Littlewood polynomials
Encoding induction in correctness proofs of program transformations as a termination problem
Philosophical heuristics
Reusing Proofs
Utilitarianism and heuristics
Proofs and Provability
Generic induction proofs
A generalization of Milnor’s formula
Independence proofs in arithmetic theories with very weak induction
Existence proofs by induction using methods of program synthesis
Independence proofs in arithmetic theories with very weak induction
Independence proofs in arithmetic theories with very weak induction
Generalization of the Macdonald formula for Hall-Littlewood polynomials
Encoding induction in correctness proofs of program transformations as a termination problem
Philosophical heuristics
Reusing Proofs
Utilitarianism and heuristics