Computability and logic
- Kategoria:
- informatyka, matematyka
- Wydawnictwo:
- Cambridge University Press
- Data wydania:
- 2007-11-01
- Data 1. wyd. pol.:
- 1974-01-01
- Data 1. wydania:
- 2007-11-01
- Liczba stron:
- 366
- Czas czytania
- 6 godz. 6 min.
- Język:
- angielski
- ISBN:
- 9780521701464
- Tagi:
- Academic Philosophy 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 Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual.
Read more at http://www.cambridge.org/pl/academic/subjects/philosophy/logic/computability-and-logic-5th-edition#BB84uWWMgrBr8LGr.99