Cambridge Core – Computing: General Interest – Computability and Logic – by George S. Boolos. but instructors who adopt Computability & Logic as a textbook are hereby authorized to copy and distribute the present Part A. This permission does not extend. Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the.

Author: Vuzahn Yozshurisar
Country: Japan
Language: English (Spanish)
Genre: Personal Growth
Published (Last): 8 November 2009
Pages: 473
PDF File Size: 4.49 Mb
ePub File Size: 18.17 Mb
ISBN: 648-5-68994-703-2
Downloads: 66701
Price: Free* [*Free Regsitration Required]
Uploader: Zulkikasa

Lattice Representations for Computability Theory. Jun 22, Warunika Ranaweera rated it it was amazing.

Book Review: Computability and Logic

There was one every few chapters. That concludes the summary. When you realize how much can be enumerated there’s a one-to-one mapping between natural numbers and all finite subsets of the natural numbers! This is one of my favorite results in mathematics, and it’s a beautiful and the original bridge between the lands of math and computer science.

Jul 14, Adam rated it it was amazing Shelves: This is all well and good, but I was expecting much more detail and motivation, given the impressive motivation found elsewhere in the book. Even computahility you’re vaguely familiar with the concept, but you’re not quite sure how a Turing machine works “wait, it only has a fixed number of states?

Sets and relations are called “primitive recursive” if their indicator functions can be constructed from primitive recursive building blocks.

Knowledge of enumerability is central to many issues in computer science, and is integral in any study of infinities. No trivia or quizzes yet. It introduces you to co,putability the right concepts.


This chapter would have been invaluable a month and a half ago, before I started Model Theory. It was especially bad in the “Further Topics” section ch.

Diagonalization stops the buck. Burgess, and Richard C. It’s formal, but pulls off a conversational tone. This is computabilitu result that’s assumed in many other texts “and, by diagonalization, we can construct…”but rarely explored in full.

G. S. Boolos & R. C. Jeffrey, Computability and Logic – PhilPapers

Request removal from index. Monthly downloads Sorry, there are not enough data points to plot this chart. The subject matter may start out a little basic for much of the audience I expect people who approach the course list to already know enumerability, the halting problem, etc. There are no discussion topics on this book yet. Nov 21, Ben Pace rated it it was amazing Shelves: Also, note that semirecursive sets are more commonly known as “recursively enumerable” sets.

If you’re casually interested in math or computer science or if you need a brush up, or you just want a good time then I highly recommend reading this book at least through chapter 8.

Some Notes on Truths and Comprehension. Or you can decide to work without function ans, and so on. Including a selection of ex Computability and Logic has become a classic because of its accessibility to students logiic 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.

Sign in Create an account.

Computability and Logic

You’ll find yourself actually walking through the actions of the machine in your head, which is a great way to get a feel for the idealized basics of computation.


Chapters would have made Model Theory quite a bit easier to tackle. Andrada Pop rated it it was amazing Mar 31, Assumming little background knowledge, it has been incredibly satisfying to be shown how various computational systems work, and then also to show that they’re equivalent. This is where the magic happens.

This article has no associated abstract. Johannes Korbmacher – – Journal of Philosophical Logic 47 2: This chapter introduces another formalism that has more machinery available to it than a Turing machine.

It’s a pretty solid introduction, and a good way to brush up on the precise syntax if you’re feeling rusty.

Computability and Logic by George S. Boolos

It may not be the fastest way to get up to speed, but it’s definitely entertaining. We now step to the math side of things.

This book excels at showing you the actual computabolity behind results that are often mentioned but seldom exposed. Thomas Schminke rated it really liked it Oct 22, This chapter introduces the syntax of first order logic.

The second chapter of Computability and Logic is a clever and easy introduction to diagonalization, and I highly recommend it to newcomers.