LEADER 03772nam  22006375  450 
001 9910814761203321
005 20230810161503.0
010   $a1-4757-3837-4
024 7 $a10.1007/978-1-4757-3837-7
035   $a(CKB)2660000000022103
035   $a(SSID)ssj0000934498
035   $a(PQKBManifestationID)11492308
035   $a(PQKBTitleCode)TC0000934498
035   $a(PQKBWorkID)10930819
035   $a(PQKB)10800123
035   $a(DE-He213)978-1-4757-3837-7
035   $a(MiAaPQ)EBC3085819
035   $a(EXLCZ)992660000000022103
100   $a20130125d1993      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 12$aA Logical Approach to Discrete Math$b[electronic resource] /$fby David Gries, Fred B. Schneider
205   $a1st ed. 1993.
210  1$aNew York, NY :$cSpringer New York :$cImprint: Springer,$d1993.
215   $a1 online resource (XVI, 516 p.) 
225 1 $aMonographs in Computer Science,$x2512-5486
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a1-4419-2835-9 
327   $a0 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.
330   $aThis text attempts to change the way we teach logic to beginning students. Instead of teaching logic as a subject in isolation, we regard it as a basic tool and show how to use it. We strive to give students a skill in the propo­ sitional and predicate calculi and then to exercise that skill thoroughly in applications that arise in computer science and discrete mathematics. We are not logicians, but programming methodologists, and this text reflects that perspective. We are among the first generation of scientists who are more interested in using logic than in studying it. With this text, we hope to empower further generations of computer scientists and math­ ematicians to become serious users of logic. Logic is the glue Logic is the glue that binds together methods of reasoning, in all domains. The traditional proof methods -for example, proof by assumption, con­ tradiction, mutual implication, and induction- have their basis in formal logic. Thus, whether proofs are to be presented formally or informally, a study of logic can provide understanding.
410  0$aMonographs in Computer Science,$x2512-5486
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aComputer arithmetic and logic units
606   $aComputer science
606   $aDiscrete Mathematics in Computer Science
606   $aArithmetic and Logic Structures
606   $aComputer Science
615  0$aComputer science$xMathematics.
615  0$aDiscrete mathematics.
615  0$aComputer arithmetic and logic units.
615  0$aComputer science.
615 14$aDiscrete Mathematics in Computer Science.
615 24$aArithmetic and Logic Structures.
615 24$aComputer Science.
676   $a004.0151
700   $aGries$b David$0944
702   $aSchneider$b Fred B
801  0$bPQKB
906   $aBOOK
912   $a9910814761203321
996   $aLogical approach to discrete math$91502266
997   $aUNINA