(en.wikipedia.org) To Mock a Mockingbird - Wikipedia

ROAM_REFS: https://en.wikipedia.org/wiki/To_Mock_a_Mockingbird

To Mock a Mockingbird and Other Logic Puzzles: Including an Amazing Adventure in Combinatory Logic (1985, ISBN 0-19-280142-2) is a book by the mathematician and logician Raymond Smullyan. It contains many nontrivial recreational puzzles of the sort for which Smullyan is well known. It is also a gentle and humorous introduction to combinatory logic and the associated metamathematics, built on an elaborate ornithological metaphor.

Combinatory logic, functionally equivalent to the lambda calculus, is a branch of symbolic logic having the expressive power of set theory, and with deep connections to questions of computability and provability. Smullyan's exposition takes the form of an imaginary account of two men going into a forest and discussing the unusual "birds" (combinators) they find there (bird watching was a hobby of one of the founders of combinatory logic, Haskell Curry, and another founder Moses Schönfinkel's name means beautiful spark (or possibly beautiful little-finch). Each species of bird in Smullyan's forest stands for a particular kind of combinator appearing in the conventional treatment of combinatory logic. Each bird has a distinctive call, which it emits when it hears the call of another bird. Hence an initial call by certain "birds" gives rise to a cascading sequence of calls by a succession of birds.

Deep inside the forest dwells the Mockingbird, which imitates other birds hearing themselves. The resulting cascade of calls and responses analogizes to abstract models of computing. With this analogy in hand, one can explore advanced topics in the mathematical theory of computability, such as Church–Turing computability and Gödel's theorem.

While the book starts off with simple riddles, it eventually shifts to a tale of Inspector Craig of Scotland Yard, who appears in Smullyan's other books; traveling from forest to forest, learning from different professors about all the different kinds of birds. He starts off in a certain enchanted forest, then goes to an unnamed forest, then to Curry's Forest (named after Haskell Curry), then to Russell's Forest, then to The Forest Without a Name, then to Gödel's Forest and finally to The Master Forest where he also answers The Grand Question.

Local Graph

org-roam a17c4195-8144-4b01-9757-0733e1944e96 (en.wikipedia.org) To Mock a Mockingb... //en.wikipedia.org/wiki/ISBN_(identifier) https://en.wikipedia.org/wiki/ISBN_(identifier) a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/ISBN_(identifier) //en.wikipedia.org/wiki/Special:BookSources/0-19-280142-2 https://en.wikipedia.org/wiki/Special:BookSources/0-19-280142-2 a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Special:BookSources/0-19-280142-2 //en.wikipedia.org/wiki/Mathematician https://en.wikipedia.org/wiki/Mathematician a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Mathematician //en.wikipedia.org/wiki/Logician https://en.wikipedia.org/wiki/Logician a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Logician //en.wikipedia.org/wiki/Raymond_Smullyan https://en.wikipedia.org/wiki/Raymond_Smullyan a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Raymond_Smullyan //en.wikipedia.org/wiki/Combinatory_logic https://en.wikipedia.org/wiki/Combinatory_logic a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Combinatory_logic //en.wikipedia.org/wiki/Metamathematics https://en.wikipedia.org/wiki/Metamathematics a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Metamathematics //en.wikipedia.org/wiki/Ornithological https://en.wikipedia.org/wiki/Ornithological a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Ornithological //en.wikipedia.org/wiki/Metaphor https://en.wikipedia.org/wiki/Metaphor a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Metaphor //en.wikipedia.org/wiki/Lambda_calculus https://en.wikipedia.org/wiki/Lambda_calculus a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Lambda_calculus //en.wikipedia.org/wiki/Symbolic_logic https://en.wikipedia.org/wiki/Symbolic_logic a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Symbolic_logic //en.wikipedia.org/wiki/Set_theory https://en.wikipedia.org/wiki/Set_theory a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Set_theory //en.wikipedia.org/wiki/Computability_theory_(computation) https://en.wikipedia.org/wiki/Computability_theory_(computation) a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Computability_theory_(computation) //en.wikipedia.org/wiki/Provability_logic https://en.wikipedia.org/wiki/Provability_logic a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Provability_logic //en.wikipedia.org/wiki/Haskell_Curry https://en.wikipedia.org/wiki/Haskell_Curry a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Haskell_Curry //en.wikipedia.org/wiki/Moses_Schönfinkel https://en.wikipedia.org/wiki/Moses_Schönfinkel a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Moses_Schönfinkel //en.wikipedia.org/wiki/Combinator https://en.wikipedia.org/wiki/Combinator a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Combinator //en.wikipedia.org/wiki/Model_of_computation https://en.wikipedia.org/wiki/Model_of_computation a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Model_of_computation //en.wikipedia.org/wiki/Theory_of_computability https://en.wikipedia.org/wiki/Theory_of_computability a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Theory_of_computability //en.wikipedia.org/wiki/Church–Turing_thesis https://en.wikipedia.org/wiki/Church–Turing_thesis a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Church–Turing_thesis //en.wikipedia.org/wiki/Gödel's_incompleteness_theorems //en.wikipedia.org/wiki/Gödel's_incompleteness_theorems a17c4195-8144-4b01-9757-0733e1944e96->//en.wikipedia.org/wiki/Gödel's_incompleteness_theorems //en.wikipedia.org/wiki/Gödel's_incompleteness_theorems https://en.wikipedia.org/wiki/Gödel's_incompleteness_theorems 2a07e4ea-610b-4c9a-bb84-d961fb2450e5 Code and Coffee Book Club 2a07e4ea-610b-4c9a-bb84-d961fb2450e5->a17c4195-8144-4b01-9757-0733e1944e96