000 | 02905nam a22003735i 4500 | ||
---|---|---|---|
001 | 279562 | ||
003 | MX-SnUAN | ||
005 | 20160429153950.0 | ||
007 | cr nn 008mamaa | ||
008 | 150903s2008 xxu| o |||| 0|eng d | ||
020 |
_a9780387762777 _99780387762777 |
||
024 | 7 |
_a10.1007/9780387762777 _2doi |
|
035 | _avtls000332655 | ||
039 | 9 |
_a201509030235 _bVLOAD _c201404122219 _dVLOAD _c201404091950 _dVLOAD _y201402041034 _zstaff |
|
040 |
_aMX-SnUAN _bspa _cMX-SnUAN _erda |
||
050 | 4 | _aQA8.9-10.3 | |
100 | 1 |
_aSrivastava, S. M. _eautor _9303965 |
|
245 | 1 | 2 |
_aA Course on Mathematical Logic / _cby S. M. Srivastava. |
264 | 1 |
_aNew York, NY : _bSpringer New York, _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 | _aUniversitext | |
500 | _aSpringer eBooks | ||
505 | 0 | _aSyntax of First-Order Logic -- Semantics of First-Order Languages -- Propositional Logic -- Proof and Metatheorems in First-Order Logic -- Completeness Theorem and Model Theory -- Recursive Functions and Arithmetization of Theories -- Incompleteness Theorems and Recursion Theory. | |
520 | _aThis is a short, distinctive, modern, and motivated introduction to mathematical logic for senior undergraduate and beginning graduate students in mathematics and computer science. Any mathematician who is interested in knowing what logic is concerned with and who would like to learn Gödel’s incompleteness theorems should find this book particularly convenient. The treatment is thoroughly mathematical, and the entire subject has been approached like a branch of mathematics. Serious efforts have been made to make the book suitable for the classroom as well as for self-reading. The book does not strive to be a comprehensive encyclopedia of logic. Still, it gives essentially all the basic concepts and results in mathematical logic. The book prepares students to branch out in several areas of mathematics related to foundations and computability such as logic, axiomatic set theory, model theory, recursion theory, and computability. The main prerequisite for this book is the willingness to work at a reasonable level of mathematical rigor and generality. Shashi Mohan Srivastava is a Professor at the Indian Statistical Institute, Kolkata, India. He is also the author of A Course on Borel Sets, GTM 180. | ||
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: _z9780387762753 |
856 | 4 | 0 |
_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-387-76277-7 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL) |
942 | _c14 | ||
999 |
_c279562 _d279562 |