Computability and Logic
De (autor): George S. Boolos
Computability and Logic 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. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.
-10%
transport gratuit
PRP: 254.83 Lei
Acesta este Pretul Recomandat de Producator. Pretul de vanzare al produsului este afisat mai jos.
229.35Lei
229.35Lei
254.83 LeiPrimesti 229 puncte
Primesti puncte de fidelitate dupa fiecare comanda! 100 puncte de fidelitate reprezinta 1 leu. Foloseste-le la viitoarele achizitii!
Livrare in 2-4 saptamani
X
Pentru a putea comanda rapid este nevoie sa introduceti numarul dvs de telefon in formatul 0xxxxxxxxx (10 cifre).Un operator Libris.ro va suna si va cere telefonic restul datelor necesare.
Descrierea produsului
Computability and Logic 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. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.
Detaliile produsului
De pe acelasi raft
Parerea ta e inspiratie pentru comunitatea Libris!