Hochschulschrift
Independence proofs in arithmetic theories with very weak induction
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
4°
- Umfang
-
69 S.
- Sprache
-
Englisch
- Anmerkungen
-
Bonn, Univ., Math.-Naturwiss. Fak., Diss. 1972. (Nicht f. d. Austausch.)
- Urheber
-
Garro, Ibrahim
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 11:39 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.
Objekttyp
- Hochschulschrift
Beteiligte
- Garro, Ibrahim
Ähnliche Objekte (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