Logical Approach to Discrete Math

AvDavid Gries,Fred B. Schneider

Inbunden, Engelska, 1993

Del i serien Monographs in Computer Science

849 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Häftad

607 kr

Beskrivning

This text attempts to change the way logic and discrete math are taught in computer science and mathematics. While many books treat logic simply as another topic of study, this book's uniqueness is its willingness to take it one step further. In the book, logic is treated as a basic tool, to be applied in essentially every other area. "This is a rather extraordinary book, and deserves to be read by everyone involved in computer science and - perhaps more importantly - software engineering. I recommend it highly. The book will be of value not only to beginning students, but also to hardened programmers with many years of experience - in Fortran, Cobol, C, C++, or whatever. If the book is taken seriously, the rigor that it unfolds and the clarity of its concepts could have a significant impact on the way in which software is conceived and developed. " -Peter G. Neumann-

Produktinformation

Utgivningsdatum:1993-10-22
Mått:155 x 235 x undefined mm
Vikt:925 g
Format:Inbunden
Språk:Engelska
Serie:Monographs in Computer Science
Antal sidor:516
Upplaga:2
Förlag:Springer-Verlag New York Inc.
ISBN:9780387941158

Utforska kategorier

Matematik inom Naturvetenskap och teknik

Recensioner i media

"This is a rather extraordinary book, and deserves to be read by everyone involved in computer science and - perhaps more importantly - software engineering. I recommend it highly... If the book is taken seriously, the rigor that it unfolds and the clarity of its concepts could have a significant impact on the way in which software is conceived and developed." - Peter G. Neumann

Innehållsförteckning

0 Using Mathematics.- 1 Textual Substitution, Equality, and Assignment.- 2 Boolean Expressions.- 3 Propositional Calculus.- 4 Relaxing the Proof Style.- 5 Applications of Propositional Calculus.- 6 Hilbert-style Proofs.- 7 Formal Logic.- 8 Quantification.- 9 Predicate Calculus.- 10 Predicates and Programming.- 11 A Theory of Sets.- 12 Mathematical Induction.- 13 A Theory of Sequences.- 14 Relations and Functions.- 15 A Theory of Integers.- 16 Combinatorial Analysis.- 17 Recurrence Relations.- 18 Modern Algebra.- 19 A Theory of Graphs.- 20 Infinite Sets.- References.- Theorems of the propositional and predicate calculi.