Computability and Logic
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. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the God…
Mehr
CHF 38.05
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
Versandkostenfrei
Produktdetails
- ISBN: 978-0-511-36429-7
- EAN: 9780511364297
- Produktnummer: 13803286
- Verlag: Cambridge University Press
- Sprache: Englisch
- Erscheinungsjahr: 2007
- Seitenangabe: 0 S.
- Plattform: PDF
- Masse: 2'484 KB
4 weitere Werke von George S. Boolos:
Bewertungen
Anmelden