Proofs and Algorithms An Introduction to Logic and Computability /

Proofs and Algorithms: An Introduction to Logic and Computability Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation. Proofs and Algorithms: An Introduction to Logic and Comput...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριος συγγραφέας: Dowek, Gilles (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: London : Springer London, 2011.
Σειρά:Undergraduate Topics in Computer Science,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 02446nam a22004695i 4500
001 978-0-85729-121-9
003 DE-He213
005 20151204143254.0
007 cr nn 008mamaa
008 110110s2011 xxk| s |||| 0|eng d
020 |a 9780857291219  |9 978-0-85729-121-9 
024 7 |a 10.1007/978-0-85729-121-9  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UY  |2 bicssc 
072 7 |a UYA  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a COM031000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
100 1 |a Dowek, Gilles.  |e author. 
245 1 0 |a Proofs and Algorithms  |h [electronic resource] :  |b An Introduction to Logic and Computability /  |c by Gilles Dowek. 
264 1 |a London :  |b Springer London,  |c 2011. 
300 |a XII, 156 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Undergraduate Topics in Computer Science,  |x 1863-7310 
520 |a Proofs and Algorithms: An Introduction to Logic and Computability Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation. Proofs and Algorithms: An Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself. Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic. 
650 0 |a Computer science. 
650 0 |a Computers. 
650 0 |a Mathematical logic. 
650 1 4 |a Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Mathematical Logic and Formal Languages. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9780857291202 
830 0 |a Undergraduate Topics in Computer Science,  |x 1863-7310 
856 4 0 |u http://dx.doi.org/10.1007/978-0-85729-121-9  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)