Proving theorems with Euclid's algorithm
Part of the Lecture Notes in Computer Science book series (LNCS, volume 445)
Part 0 Summaries ofthe expositional essays
Algorithms can be used to prove theorems. This chapter illustrates how the notion of invariance can assist in proving equivalences directly instead of by mutual implication.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1990