000 03607nam a22003735i 4500
001 287658
003 MX-SnUAN
005 20160429154556.0
007 cr nn 008mamaa
008 150903s2012 xxk| o |||| 0|eng d
020 _a9781447141297
_99781447141297
024 7 _a10.1007/9781447141297
_2doi
035 _avtls000339729
039 9 _a201509030318
_bVLOAD
_c201404300404
_dVLOAD
_y201402060942
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA8.9-QA10.3
100 1 _aBen-Ari, Mordechai.
_eautor
_9316950
245 1 0 _aMathematical Logic for Computer Science /
_cby Mordechai Ben-Ari.
250 _a3rd ed. 2012.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2012.
300 _axv, 346 páginas 79 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
500 _aSpringer eBooks
505 0 _aPreface -- Introduction -- Propositional Logic: Formulas, Models, Tableaux -- Propositional Logic: Deductive Systems -- Propositional Logic: Resolution -- Propositional Logic: Binary Decision Diagrams -- Propositional Logic: SAT Solvers -- First-Order Logic: Formulas, Models, Tableaux -- First-Order Logic: Deductive Systems -- First-Order Logic: Terms and Normal Forms -- First-Order Logic: Resolution -- First-Order Logic: Logic Programming -- First-Order Logic: Undecidability and Model Theory -- Temporal Logic: Formulas, Models, Tableaux -- Temporal Logic: A Deductive System -- Verification of Sequential Programs -- Verification of Concurrent Programs -- Set Theory -- Index of Symbols -- Index of Names -- Subject Index.
520 _aMathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to understand. The uniform use of tableaux-based techniques facilitates learning advanced logical systems based on what the student has learned from elementary systems. The logical systems presented are: propositional logic, first-order logic, resolution and its application to logic programming, Hoare logic for the verification of sequential programs, and linear temporal logic for the verification of concurrent programs. The third edition has been entirely rewritten and includes new chapters on central topics of modern computer science: SAT solvers and model checking. There are 150 exercises with answers available to qualified instructors. Documented, open-source, Prolog source code for the algorithms is available at http://code.google.com/p/mlcs/ Mordechai (Moti) Ben-Ari is with the Department of Science Teaching at the Weizmann Institute of Science. He is a Distinguished Educator of the ACM and has received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education. His other textbooks published by Springer are: Ada for Software Engineers (Second Edition) and Principles of the Spin Model Checker.
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:
_z9781447141280
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-1-4471-4129-7
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c287658
_d287658