On the Shape of Mathematical Arguments

This book deals with the presentation and systematic design of mathematical proofs, including correctness proofs of algorithms. Its purpose is to show how completeness of argument, an important constraint especially for the correctness of algorithms, can be combined with brevity. The author stresses...

Full description

Bibliographic Details
Main Author: Gasteren, Antonetta J.M. van
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1990, 1990
Edition:1st ed. 1990
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02883nmm a2200313 u 4500
001 EB000657681
003 EBX01000000000000000510763
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540471660 
100 1 |a Gasteren, Antonetta J.M. van 
245 0 0 |a On the Shape of Mathematical Arguments  |h Elektronische Ressource  |c by Antonetta J.M. van Gasteren 
250 |a 1st ed. 1990 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1990, 1990 
300 |a XII, 184 p  |b online resource 
505 0 |a A termination argument -- A problem on bichrome 6-graphs -- Proving the existence of the Euler line -- In adherence to symmetry -- On a proof by Arbib, Kfoury, and Moll -- Not about open and closed sets -- A monotonicity argument -- On the inverse of a function -- A calculational proof of Helly's theorem on convex figures -- The formal derivation of a proof of the invariance theorem -- Proving theorems with Euclid's algorithm -- On the deisng of an in-situ permutation algorithm -- Shiloach's algorithm -- Clarity of exposition -- On naming -- On the ue of formalism -- Epilogue -- Proof rules for guarded-command programs -- Notational conventions 
653 |a Computer Science Logic and Foundations of Programming 
653 |a Software engineering 
653 |a Computer science 
653 |a Logic 
653 |a Software Engineering 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/BFb0020908 
856 4 0 |u https://doi.org/10.1007/BFb0020908?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.1 
520 |a This book deals with the presentation and systematic design of mathematical proofs, including correctness proofs of algorithms. Its purpose is to show how completeness of argument, an important constraint especially for the correctness of algorithms, can be combined with brevity. The author stresses that the use of formalism is indispensible for achieving this. A second purpose of the book is to discuss matters of design. Rather than addressing psychological questions, the author deals with more technical questions like how analysis of the shape of the demonstrandum can guide the design of a proof. This technical rather than psychological view of heuristics together with the stress on exploiting formalism effectively are two key features of the book. The book consists of two independently readable parts. One part includes a number of general chapters discussing techniques for clear exposition, the use of formalism, the choice of notations, the choice of what to name and how to name it, and so on. The other part consists of a series of expositional essays, each dealing with a proof or an algorithm and illustrating the use of techniques discussed in the more general chapters