| 000 | 01888nam a2200301 a 4500 | ||
|---|---|---|---|
| 001 | vtls000038070 | ||
| 003 | KUKTEM | ||
| 005 | 20251117145416.0 | ||
| 008 | 090617t2008 nyua f b 001 0 eng d | ||
| 020 | _a9781846288449 | ||
| 020 | _a1846288444 | ||
| 039 | 9 |
_a201107132138 _bVLOAD _c201006151405 _djamie _c200908141632 _dVLOAD _c200908141606 _dVLOAD _y200906171547 _znadia |
|
| 040 | _aUMP | ||
| 090 | _aQA76.9.M35 M35 2008 | ||
| 100 | 1 | _aMakinson, David. | |
| 245 | 1 | 0 |
_aSets, logic and maths for computing / _cby David Makinson |
| 260 |
_aNew York : _bSpringer, _c2008 |
||
| 300 |
_axv, 301 p. : _bill. ; _c24 cm. |
||
| 490 | 1 | _aUndergraduate topics in computer science | |
| 504 | _aIncludes bibliographical references and index | ||
| 505 | 0 | _aBefore the Beginning.- Do I really need to know about this?.- Proving and disproving: Logical techniques.- Proving and disproving: Mathematical techniques.- First Steps.- Flat set theory.- Families of sets.- Relations.- Functions.- Structures.- Order.- Trees.- Graphs.- Logic.- Truth-functional connectives.- Quantifiers.- Counting.- The pigeonhole principles.- The addition and multiplication rules.- Selection rules.- Probability.- The Kolmogorov axioms for finitely additive probability.- Combining combinatorics and probability | |
| 520 | _aThis easy-to-follow text allows readers to carry out their computing studies with a clear understanding of the basic finite mathematics and logic that they will need. Written explicitly for undergraduates, it requires only a minimal mathematical background and is ideal for self-study as well as classroom use | ||
| 650 | 0 |
_aComputer science _xMathematics |
|
| 650 | 6 |
_aInformatique _xMathématiques |
|
| 830 | 0 | _aUndergraduate topics in computer science | |
| 999 |
_aVIRTUA40 _c45623 _d45629 |
||
| 999 | _aVTLSSORT0080*0200*0201*0400*0900*1000*2450*2600*3000*4900*5040*5050*5200*6500*6501*8300*9991 | ||
| 942 | 0 | 0 | _02 |