000			03758nam a22003855i 4500
001			287612
003			MX-SnUAN
005			20160429154553.0
007			cr nn 008mamaa
008			150903s2012 xxk| o |||| 0|eng d
020			_a9781447125006 _99781447125006
024	7		_a10.1007/9781447125006 _2doi
035			_avtls000339606
039		9	_a201509030839 _bVLOAD _c201404300402 _dVLOAD _y201402060939 _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.
250			_a2nd ed. 2012.
264		1	_aLondon : _bSpringer London, _c2012.
300			_axxI, 283 páginas 17 ilustraciones _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 -- Just Supposing: Proof and Consequence.
520			_aThis easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduate students need to enter the world of computer and information sciences. The language is in part qualitative, with concepts such as set, relation, function and recursion/induction; but it is also partly quantitative, with principles of counting and finite probability. Entwined with both are the fundamental notions of logic and their use for representation and proof. In ten chapters on these topics, the book guides the student through essential concepts and techniques. The extensively revised second edition provides further clarification of matters that typically give rise to difficulty in the classroom and restructures the chapters on logic to emphasize the role of consequence relations and higher-level rules, as well as including more exercises and solutions. Topics and features: Teaches finite mathematics as a language for thinking, as much as knowledge and skills to be acquired Uses an intuitive approach with a focus on examples for all general concepts Brings out the interplay between the qualitative and the quantitative in all areas covered, particularly in the treatment of recursion and induction Balances carefully the abstract and concrete, principles and proofs, specific facts and general perspectives Includes highlight boxes that raise common queries and clear away confusions Provides numerous exercises, with selected solutions, to test and deepen the reader’s understanding This clearly-written text/reference is a must-read for first-year undergraduate students of computing. Assuming only minimal mathematical background, it is ideal for both the classroom and independent study. Dr. David Makinson is a Visiting Professor in the Department of Philosophy, Logic and Scientific Method at the London School of Economics, UK.
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: _z9781447124993
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-4471-2500-6 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c287612 _d287612