Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
London :
Springer London : Imprint: Springer,
2011.
|
| Edición: | 1st ed. 2011. |
| Colección: | Undergraduate Topics in Computer Science,
|
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-0-85729-121-9 | ||
| 003 | DE-He213 | ||
| 005 | 20220113215241.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 | |
| 050 | 4 | |a QA75.5-76.95 | |
| 072 | 7 | |a UYA |2 bicssc | |
| 072 | 7 | |a COM014000 |2 bisacsh | |
| 072 | 7 | |a UYA |2 thema | |
| 082 | 0 | 4 | |a 004.0151 |2 23 |
| 100 | 1 | |a Dowek, Gilles. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Proofs and Algorithms |h [electronic resource] : |b An Introduction to Logic and Computability / |c by Gilles Dowek. |
| 250 | |a 1st ed. 2011. | ||
| 264 | 1 | |a London : |b Springer London : |b Imprint: Springer, |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 2197-1781 | |
| 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 Machine theory. | |
| 650 | 1 | 4 | |a Theory of Computation. |
| 650 | 2 | 4 | |a Formal Languages and Automata Theory. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9780857291202 |
| 776 | 0 | 8 | |i Printed edition: |z 9780857291226 |
| 830 | 0 | |a Undergraduate Topics in Computer Science, |x 2197-1781 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/978-0-85729-121-9 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||