Computability and Logic

Copertina anteriore
Cambridge University Press, 17 set 2007 - 366 pagine
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.

Cosa dicono le persone - Scrivi una recensione

Nessuna recensione trovata nei soliti posti.

Altre edizioni - Visualizza tutto

Informazioni bibliografiche