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...
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...
George S. Boolos, John P. Burgess, Richard C. Jeffrey
Počet strán
366
Rok vydania
2007
Popis produktu
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.
Chýba alebo je nepravdivý niektorý dôležitý parameter? Uvedené informácie sú len orientačné, pred nákupom vo vybranom obchode odporúčame overiť, že predávaný model má kľúčové vlastnosti podľa vašich požiadaviek. Aj keď sa snažíme o maximálnu presnosť informácií, bohužiaľ nemôžeme zaručiť 100% správnosť. Ceny produktov sú vrátane DPH.
