- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
69 S.
- Sprache
-
Deutsch
- Anmerkungen
-
Literaturverz. S. 67 - 69
- Erschienen in
-
Interner Bericht / Universität Karlsruhe (TH) ; Nr. 87,6
- Ereignis
-
Veröffentlichung
- (wo)
-
Karlsruhe
- (wer)
-
Univ., Fak. für Informatik
- (wann)
-
1987
- Urheber
-
Hummel, Birgit
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 12:28 MEZ
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.
Beteiligte
- Hummel, Birgit
- Univ., Fak. für Informatik
Entstanden
- 1987
Ähnliche Objekte (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