£86.79

Cambridge University Press Computability and Logic

Name: Computability and Logic
Brand: Cambridge University Press
Price: 86.48 GBP
Availability: InStock

Mathematical Logic

Price History & Forecast

Last 78 days • 78 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 78 days • 1 price levels

Days at Price

Price Analysis

Most common price: £87 (78 days, 100.0%)

Price range: £87 - £87

Price levels: 1 different prices over 78 days

Description

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.

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 0521877520
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Mathematical Foundations > Mathematical Logic
Domain: Amazon UK
Release Date: 17 September 2007
Listed Since: 06 June 2007

Barcode

No barcode data available

Cambridge University Press Computability and Logic

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Proofs and Computations (Perspectives in Logic)

Logic and Theory of Algorithms: 4th Conference on Computability in Europe, CiE 2008 Athens, Greece, June 15-20, 2008, Proceedings: 5028 (Lecture Notes in Computer Science, 5028)

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000: 4 (De Gruyter Series in Logic & its Applications, 4)

Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity

Selected Papers Of John H. Holland: A Pioneer In Complexity Science: 4 (Exploring Complexity)

R-CALCULUS: A Logic of Belief Revision (Perspectives in Formal Induction, Revision and Evolution)

Fundamentals of Computation Theory: 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings: 4639 (Lecture Notes in Computer Science, 4639)

Logic for Computer Science and Artificial Intelligence

Constructive Models (Siberian School of Algebra and Logic)

Computational Logic and Human Thinking: How to Be Artificially Intelligent

Mathematics in Computing: An Accessible Guide to Historical, Foundational and Application Contexts (Undergraduate Topics in Computer Science)

Logic Colloquium '03: Lecture Notes in Logic 24

Mathematical Logic: Exercises and Solutions (Problem Books in Mathematics)

Decidability of Logical Theories and Their Combination (Studies in Universal Logic)

Introduction to Mathematical Logic: Set Theory Computable Functions Model Theory (Undergraduate Texts in Mathematics)

Foundations of Information Technology in the Era of Network and Mobile Computing: IFIP 17th World Computer Congress ― TC1 Stream / 2nd IFIP ... Information and Communication Technology, 96)

LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings: 10807 (Lecture Notes in Computer Science, 10807)

The Combinatory Programme (Progress in Theoretical Computer Science)

Reflections on the Work of C.A.R. Hoare

Semantics and Logics of Computation: 14 (Publications of the Newton Institute, Series Number 14)

Limits of Computation: An Introduction to the Undecidable and the Intractable

The Collected Works of Larry Wos: Applying Automated Reasoning to Puzzles, Problems, and Open Questions Vol 1

Sets, Logic and Maths for Computing (Undergraduate Topics in Computer Science)

Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)