The Mechanization of the Diagonalization Proof Strategy
- We present an empirical study of mathematical proofs by diagonalization, the aim istheir mechanization based on proof planning techniques. We show that these proofs canbe constructed according to a strategy that (i) finds an indexing relation, (ii) constructsa diagonal element, and (iii) makes the implicit contradiction of the diagonal elementexplicit. Moreover we suggest how diagonal elements can be represented.
Download full text files
Additional Services
| Author: | Lassaad Cheikhrouhou |
|---|---|
| URN: | urn:nbn:de:hbz:386-kluedo-3717 |
| Series (Serial Number): | SEKI Report (96,14) |
| Document Type: | Preprint |
| Language of publication: | English |
| Year of Completion: | 1999 |
| Year of first Publication: | 1999 |
| Publishing Institution: | Technische Universität Kaiserslautern |
| Date of the Publication (Server): | 2000/04/03 |
| Faculties / Organisational entities: | Kaiserslautern - Fachbereich Informatik |
| DDC-Cassification: | 0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik |
| Licence (German): |  Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |