A Logical Approach to Discrete Math: Monographs in Computer Science
Autor David Gries, Fred B. Schneideren Limba Engleză Paperback – dec 2010
Din seria Monographs in Computer Science
- 20%
Preț: 340.95 lei - 20%
Preț: 617.20 lei - 20%
Preț: 317.70 lei - 20%
Preț: 617.38 lei - 20%
Preț: 630.68 lei - 20%
Preț: 616.39 lei - 20%
Preț: 324.28 lei - 15%
Preț: 621.97 lei - 20%
Preț: 1396.31 lei - 20%
Preț: 318.67 lei - 20%
Preț: 635.90 lei - 20%
Preț: 343.86 lei - 20%
Preț: 1235.26 lei - 20%
Preț: 336.09 lei - 20%
Preț: 326.55 lei - 20%
Preț: 320.55 lei - 20%
Preț: 318.35 lei - 18%
Preț: 713.89 lei - 20%
Preț: 320.97 lei - 20%
Preț: 955.14 lei - 20%
Preț: 683.76 lei - 20%
Preț: 334.98 lei - 20%
Preț: 619.89 lei - 20%
Preț: 953.25 lei - 15%
Preț: 489.45 lei -
Preț: 385.10 lei - 20%
Preț: 624.95 lei - 18%
Preț: 919.67 lei - 20%
Preț: 319.15 lei - 20%
Preț: 573.07 lei -
Preț: 371.27 lei - 20%
Preț: 959.60 lei - 20%
Preț: 800.13 lei - 20%
Preț: 632.01 lei - 15%
Preț: 559.53 lei - 20%
Preț: 949.76 lei - 20%
Preț: 330.66 lei - 20%
Preț: 319.15 lei - 20%
Preț: 1405.64 lei - 20%
Preț: 962.27 lei - 20%
Preț: 1243.01 lei - 20%
Preț: 615.94 lei - 20%
Preț: 1567.33 lei
Preț: 333.94 lei
Preț vechi: 417.43 lei
-20%
Puncte Express: 501
Carte tipărită la comandă
Livrare economică 02-16 iunie
Specificații
ISBN-13: 9781441928351
ISBN-10: 1441928359
Pagini: 524
Ilustrații: XVI, 516 p.
Dimensiuni: 156 x 234 x 29 mm
Greutate: 0.79 kg
Ediția:Softcover reprint of hardcover 1st ed. 1993
Editura: Springer
Colecția Monographs in Computer Science
Seria Monographs in Computer Science
Locul publicării:New York, NY, United States
ISBN-10: 1441928359
Pagini: 524
Ilustrații: XVI, 516 p.
Dimensiuni: 156 x 234 x 29 mm
Greutate: 0.79 kg
Ediția:Softcover reprint of hardcover 1st ed. 1993
Editura: Springer
Colecția Monographs in Computer Science
Seria Monographs in Computer Science
Locul publicării:New York, NY, United States
Public țintă
Lower undergraduateCuprins
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.
Recenzii
"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
Caracteristici
Request lecturer material: sn.pub/lecturer-material