Mon premier blog

Computability and Logic George S. Boolos, John P. Burgess, Richard C. Jeffrey
Publisher: Cambridge University Press

This time in formal logic/computability theory, picking up on a problem I was considering a lot in grad school when I was in Philosophy, and have thought about from time to time since. Hein, Discrete Structures, Logic, and Computability. Abstract: Computability theory, which investigates computable functions and computable sets, lies at the foundation of logic and computer science. Burgess is co-author of the definitive textbook "Computability and Logic" and author of "Philosophical Logic.". New book makes link between philosophy and quantum computing . Description: About the Author Vesanto Melina, M. '… gives an excellent coverage of the fundamental theoretical results about logic involving computability, undecidability, axiomatization, definability, incompleteness, etc. Its classical presentations usually involve a fair amount of Goedel encodings. He teaches several courses in logic and advises undergraduate independent work in philosophy and mathematics. There are a few theorems of the form: any graph property expressible in a powerful logic is computable on a class of graphs in linear time.