Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematics --- Bewijstheorie --- Preuve [Theorie de la ] --- Proof theory --- Mathématiques --- --Mathematics --- --Bewijstheorie

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Bewijstheorie --- Preuve [Theorie de la ] --- Proof theory --- Proof theory. --- Théorie de la preuve --- 681.3*D24 --- 681.3*F31 --- Logic, Symbolic and mathematical --- Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*D24 Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- Théorie de la preuve --- Software engineering. --- Logic. --- Logic design. --- Software Engineering/Programming and Operating Systems. --- Logics and Meanings of Programs. --- Software Engineering. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Argumentation --- Deduction (Logic) --- Deductive logic --- Dialectic (Logic) --- Logic, Deductive --- Intellect --- Philosophy --- Psychology --- Science --- Reasoning --- Thought and thinking --- Computer software engineering --- Engineering --- Methodology