Trivializing the Proof of Trivial Theorems
Abstract
Besides a definition of theorem, this paper presents a sketch of our methodology for the generalization of recurrence proofs on trivial theorems but that lead, in a context of automatic theorem proving, to very lengthy (or even impossible to achieve) proofs. This paper reduces to a description of a detailed example, we hope to make clear that our methodology is of a much wider field of application.
Cite
Text
Kodratoff and Castaing. "Trivializing the Proof of Trivial Theorems." International Joint Conference on Artificial Intelligence, 1983.Markdown
[Kodratoff and Castaing. "Trivializing the Proof of Trivial Theorems." International Joint Conference on Artificial Intelligence, 1983.](https://mlanthology.org/ijcai/1983/kodratoff1983ijcai-trivializing/)BibTeX
@inproceedings{kodratoff1983ijcai-trivializing,
title = {{Trivializing the Proof of Trivial Theorems}},
author = {Kodratoff, Yves and Castaing, Jacqueline},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1983},
pages = {930-932},
url = {https://mlanthology.org/ijcai/1983/kodratoff1983ijcai-trivializing/}
}