Advertisement

Proving theorems with Euclid's algorithm

Part 0 Summaries ofthe expositional essays
Part of the Lecture Notes in Computer Science book series (LNCS, volume 445)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Personalised recommendations