000 03425nam a22003735i 4500
001 291427
003 MX-SnUAN
005 20160429154856.0
007 cr nn 008mamaa
008 150903s2008 xxk| o |||| 0|eng d
020 _a9781846288456
_99781846288456
024 7 _a10.1007/9781846288456
_2doi
035 _avtls000344044
039 9 _a201509030402
_bVLOAD
_c201405050301
_dVLOAD
_y201402061246
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.M35 
100 1 _aMakinson, David.
_eautor
_9311084
245 1 0 _aSets, Logic and Maths for Computing /
_cby David Makinson.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2008.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aUndergraduate Topics in Computer Science,
_x1863-7310
500 _aSpringer eBooks
505 0 _aCollecting Things Together: Sets -- Comparing Things: Relations -- Associating One Item with Another: Functions -- Recycling Outputs as Inputs: Induction and Recursion -- Counting Things: Combinatorics -- Weighing the Odds: Probability -- Squirrel Math: Trees -- Yea and Nay: Propositional Logic -- Something about Everything: Quantificational Logic.
520 _aUniversity studies in computing require the ability to pass from a concrete problem to an abstract representation, reason with the abstract structure, and return with useful solutions to the specific situation. The tools for developing these skills are in part qualitative – concepts such as set, relation, function, and structures such as trees and well-founded orders. They are also in part quantitative – notably elementary combinatorics and finite probability. Recurring in all of these are instruments of proof, both purely logical ones (such as proof by contradiction) and mathematical (the various forms of induction). Features: • Explains the basic mathematical tools required by students as they set out in their studies of Computer or Information Science • Explores the interplay between qualitative thinking and calculation • Teaches the material as a language for thinking, as much as knowledge to be acquired • Uses an intuitive approach with a focus on examples for all general concepts • Provides numerous exercises, solutions and proofs to deepen and test the reader’s understanding • Includes highlight boxes that raise common queries and clear away confusions • Tandems with additional electronic resources including slides on author's website http://david.c.makinson.googlepages.com This 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.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9781846288449
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-84628-845-6
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c291427
_d291427