000 03716nam a22003855i 4500
001 280502
003 MX-SnUAN
005 20160429154027.0
007 cr nn 008mamaa
008 150903s2011 xxk| o |||| 0|eng d
020 _a9780857298089
_99780857298089
024 7 _a10.1007/9780857298089
_2doi
035 _avtls000333998
039 9 _a201509030243
_bVLOAD
_c201404300253
_dVLOAD
_y201402041137
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA75.5-76.95
100 1 _aSchwartz, Jacob T.
_eautor
_989189
245 1 0 _aComputational Logic and Set Theory :
_bApplying Formalized Logic to Analysis /
_cby Jacob T. Schwartz, Domenico Cantone, Eugenio G. Omodeo.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2011.
300 _axvii, 416 páginas 2 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 _aIntroduction -- Propositional and Predicate-Calculus Preliminaries -- A Survey of Inference Mechanisms -- More on the Structure of the Verifier System -- A Closer Examination of the Sequence of Definitions and Theorems Presented in this Book -- Undecidability and Unsolvability.
520 _aAs computer software becomes more complex, the question of how its correctness can be assured grows ever more critical. Formal logic embodied in computer programs is an important part of the answer to this problem. This must-read text presents the pioneering work of the late Professor Jacob (Jack) T. Schwartz on computational logic and set theory and its application to proof verification techniques, culminating in the ÆtnaNova system, a prototype computer program designed to verify the correctness of mathematical proofs presented in the language of set theory. Taking a systematic approach, the book begins with a survey of traditional branches of logic before describing in detail the underlying design of the ÆtnaNova system. Major classical results on undecidability and unsolvability are then recast for this system. Readers do not require great knowledge of formal logic in order to follow the text, but a good understanding of standard programming techniques, and a familiarity with mathematical definitions and proofs reflecting the usual levels of rigor is assumed. Topics and features: With a Foreword by Dr. Martin Davis, Professor Emeritus of the Courant Institute of Mathematical Sciences, New York University Describes in depth how a specific first-order theory can be exploited to model and carry out reasoning in branches of computer science and mathematics Presents an unique system for automated proof verification on the large scale Integrates important proof-engineering issues, reflecting the goals of large-scale verifiers Includes an appendix showing formalized proofs of ordinals, of various properties of the transitive closure operation, of finite and transfinite induction principles, and of Zorn’s lemma This ground-breaking work is essential reading for researchers and advanced graduates of computer science.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aCantone, Domenico.
_eautor
_9305468
700 1 _aOmodeo, Eugenio G.
_eautor
_9305469
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780857298072
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-85729-808-9
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c280502
_d280502