On the shape of mathematical arguments
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Mechanization of proofs and logical operations (03B35) Proof theory and constructive mathematics (03F99) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Specification and verification (program logics, model checking, etc.) (68Q60)
The book deals with ``human theorem proving, and not with mechanical verification or mechanical theorem proving. The author does not address psychological questions like: ``How do people find solutions``; she addresses more technical questions like: ``How can proof design be guided by syntactic analysis of the demonstrandum. The book consists of two parts. The first one contains a mosaic of expositional essays, each of them dealing with one particular theorem; their proofs are used to illustrate what formalism is suitable to represent them in a form acceptable for computer scientists. Several technical criterions by which one argument can be objectively less streamlined than another are presented. Among the topics explored are proofs by cases, exploitation of symmetry, the problem of what to name, the exploitation of equivalence, proofs by calculation and their influence on the choice of notations, the degree of detail of proofs, and linearization of proofs. The second part consists of several more general chapters dealing in a more general setting with naming, clarity of exposition and notations. Although the book is written as the ``explanation-by-examples it may be of interest for computer scientists dealing with program verification or mechanical theorem proving.
- Computer theorem proving in mathematics
- scientific article; zbMATH DE number 4056963
- Formal proof -- theory and practice
- scientific article; zbMATH DE number 5228272
- The THOREM project: A progress report
- scientific article; zbMATH DE number 949290
- scientific article; zbMATH DE number 3870636
- TPS: A hybrid automatic-interactive system for developing proofs
- Checking proofs
- scientific article; zbMATH DE number 5555043
- Structured calculational proof
- An approach to literate and structured formal developments
- Correctness, explanation and intention
- Searching for proofs (and uncovering capacities of the mathematical mind)
- Algorithmic problem solving
- Pathways of deductions
- Incremental System Modelling in Event-B
- scientific article; zbMATH DE number 4099291 (Why is no real title available?)
- On the design of mathematical concepts
- On the purpose of Event-B proof obligations
- Representation and productive ambiguity in mathematics and the sciences
- An elementary and unified approach to program correctness
- On Euclid's algorithm and elementary number theory
- A Mizar mode for HOL
- An example of goal-directed, calculational proof
This page was built for publication: On the shape of mathematical arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1188723)