- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
47 S.
- Sprache
-
Deutsch
- Erschienen in
-
Forschungsberichte des Fachbereichs Informatik der Universität Dortmund / Universität Dortmund ; Nr. 440
- Ereignis
-
Veröffentlichung
- (wo)
-
Dortmund
- (wer)
-
Dekanat Informatik, Univ.
- (wann)
-
1992
- Urheber
-
Padawitz, Peter
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:37 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.
Beteiligte
- Padawitz, Peter
- Dekanat Informatik, Univ.
Entstanden
- 1992
Ähnliche Objekte (12)
Independence proofs in arithmetic theories with very weak induction
Independence proofs in arithmetic theories with very weak induction
An investigation of formula generalization heuristics for induction proofs
Independence proofs in arithmetic theories with very weak induction
Existence proofs by induction using methods of program synthesis
Encoding induction in correctness proofs of program transformations as a termination problem
Synthetic proofs
Reusing Proofs
Ontological proofs today
Computable Short Proofs
Proofs and "Puzzles"
Automated termination proofs
Independence proofs in arithmetic theories with very weak induction
Independence proofs in arithmetic theories with very weak induction
An investigation of formula generalization heuristics for induction proofs
Independence proofs in arithmetic theories with very weak induction
Existence proofs by induction using methods of program synthesis
Encoding induction in correctness proofs of program transformations as a termination problem
Synthetic proofs
Reusing Proofs
Ontological proofs today
Computable Short Proofs
Proofs and "Puzzles"
Automated termination proofs
Independence proofs in arithmetic theories with very weak induction
Independence proofs in arithmetic theories with very weak induction
An investigation of formula generalization heuristics for induction proofs
Independence proofs in arithmetic theories with very weak induction
Existence proofs by induction using methods of program synthesis
Encoding induction in correctness proofs of program transformations as a termination problem
Synthetic proofs
Reusing Proofs
Ontological proofs today
Computable Short Proofs
Proofs and "Puzzles"