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...

Description complète

Enregistré dans:
Détails bibliographiques
Auteur principal: Gasteren, Antonetta J. M. van, 1952-
Autres auteurs: Dijkstra, Edsger Wybe, 1930-2002 (Auteur de l'introduction, etc.)
Format: Livre numérique
Langue:Anglais
Publié: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Collection:Lecture notes in computer science 445
Sujets:
Accès en ligne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• On the shape of mathematical arguments, A.J.M. van Gasteren, Berlin, Springer-Verlag, 1990, 1 vol. (VIII-180 p.), Lecture notes in computer science, 3-540-52849-0
• On the Shape of Mathematical Arguments, Texte imprimé, 9783662182116
Table des matières:
  • 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.