How to prove it a structured approach Daniel J. Velleman.
Detalles de publicación: Cambridge [England] New York Cambridge University 1994.Descripción: 304 pISBN:- 0521441161
- 511.3 20
- QA9 .V38 1994
| Imagen de cubierta | Tipo de ítem | Biblioteca actual | Biblioteca de origen | Colección | Ubicación en estantería | Signatura topográfica | Materiales especificados | Info Vol | URL | Copia número | Estado | Notas | Fecha de vencimiento | Código de barras | Reserva de ítems | Prioridad de la cola de reserva de ejemplar | Reservas para cursos | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Libro | Biblioteca Encarnación Valdés Colección General bev | 511.3 V439h (Navegar estantería(Abre debajo)) | Disponible | 80000001790149 |
Descripciones mejoradas de Syndetics:
Many students have trouble the first time they take a mathematics course in which proofs play a significant role. This textbook will prepare students to make the transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs. The book begins with the basic concepts of logic and set theory, to familiarise students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. The author shows how complex proofs are built up from these smaller steps, using detailed 'scratchwork' sections to expose the machinery of proofs about the natural numbers, relations, functions and infinite sets. Numerous exercises give students the opportunity to construct their own proofs. No background beyond standard high school mathematics is assumed. This book will be useful to anyone interested in logic and proofs: computer scientists, philosophers, linguists, and of course mathematicians.
Includes bibliographical references.
Tabla de contenidos provista por Syndetics
- 1 Sentential logic
- 2 Quantificational logic
- 3 Proofs
- 4 Relations
- 5 Functions
- 6 Mathematical induction
- 7 Infinite sets