Computability and logic /

other_versions_link

This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic b...

Celý popis

Podrobná bibliografie
Hlavní autor: Boolos, George S.
Další autoři: Burgess, John P., Jeffrey, Richard C.
Médium: Printed Book
Jazyk:English
Vydáno: Cambridge ; New York : Cambridge University Press, 2002.
Vydání:4th ed.
Témata:
Computable functions.
Logic, Symbolic and mathematical.
Recursive functions.
On-line přístup:http://www.loc.gov/catdir/toc/cam024/2001043302.html
http://www.loc.gov/catdir/description/cam022/2001043302.html
LEADER 02138cam a2200301 a 4500
008 010802s2002 enka b 001 0 eng
020 |a 0521007585 (pbk.) 
020 |a 0521809754 
082 0 0 |a 511.3  |2 21 
100 1 |a Boolos, George S. 
245 1 0 |a Computability and logic /  |c George S. Boolos 
250 |a 4th ed.  
260 |a Cambridge ;  |a New York :  |b Cambridge University Press,  |c 2002. 
300 |a xi, 356 p. :  |b ill. ;  |c 27 cm. 
504 |a Includes bibliographical references (p. 348) and index. 
520 |a This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic because of its accessibility to students without a mathematical background, and because it covers not simply the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer. 
650 0 |a Computable functions. 
650 0 |a Logic, Symbolic and mathematical. 
650 0 |a Recursive functions. 
700 1 |a Burgess, John P., 
700 1 |a Jeffrey, Richard C. 
856 4 1 |u http://www.loc.gov/catdir/toc/cam024/2001043302.html 
856 4 2 |u http://www.loc.gov/catdir/description/cam022/2001043302.html 
906 |a 7  |b cbc  |c orignew  |d 1  |e ocip  |f 20  |g y-gencatlg 
942 |c BK 
955 |a pc22 2001-08-02 to ASCD  |i jp99 2001-08-03  |a aa07 2001-08-08  |a ps11 2002-05-03 bk rec'd, to CIP ver.  |a jp00 2002-05-09  |a jp14 2002-06-06 c.2 to BCCD 
999 |c 276068  |d 276068 
952 |0 0  |1 0  |2 ddc  |4 0  |6 511_300000000000000_BOO_C  |7 0  |9 310589  |a PHL  |b PHL  |c ST1  |d 2015-08-04  |i 3884  |l 0  |o 511.3 BOO/C  |p PHL3884  |r 2015-08-04  |y BK 

Podobné jednotky