To Mock a Mockingbird (original) (raw)
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.
| Property | Value |
|---|---|
| dbo:abstract | 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 bird). 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. (en) |
| dbo:thumbnail | wiki-commons:Special:FilePath/To_Mock_a_Mockingbird.jpg?width=300 |
| dbo:wikiPageExternalLink | http://dkeenan.com/Lambda/index.htm http://www.angelfire.com/tx4/cus/combinator/birds.html |
| dbo:wikiPageID | 5275678 (xsd:integer) |
| dbo:wikiPageLength | 3740 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1056799913 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Metaphor dbr:Metamathematics dbc:Combinatory_logic dbc:1985_non-fiction_books dbc:Alfred_A._Knopf_books dbr:Combinatory_logic dbr:Church–Turing_thesis dbr:Brain_teaser dbr:Moses_Schönfinkel dbr:Paperback dbr:Symbolic_logic dbr:Mathematician dbr:Logic_puzzle dbr:Alfred_A._Knopf dbr:Paradox dbr:Gödel's_incompleteness_theorems dbr:Haskell_Curry dbc:Puzzle_books dbr:Lambda_calculus dbr:Provability_logic dbr:B,_C,_K,_W_system dbr:Raymond_Smullyan dbr:Set_theory dbr:Model_of_computation dbr:SKI_combinator_calculus dbr:Fixed-point_combinator dbr:Logician dbr:Ornithological dbr:Combinator dbr:Computability_theory_(computation) dbr:Theory_of_computability |
| dbp:author | dbr:Raymond_Smullyan |
| dbp:country | United States (en) |
| dbp:isbn | 0 (xsd:integer) |
| dbp:language | English (en) |
| dbp:mediaType | Print (en) |
| dbp:name | To Mock a Mockingbird and Other Logic Puzzles: Including an Amazing Adventure in Combinatory Logic (en) |
| dbp:oclc | 248314322 (xsd:integer) |
| dbp:pages | 246 (xsd:integer) |
| dbp:publisher | dbr:Alfred_A._Knopf |
| dbp:releaseDate | 1985 (xsd:integer) |
| dbp:wikiPageUsesTemplate | dbt:Distinguish dbt:Infobox_book dbt:Short_description dbt:Isbn |
| dct:subject | dbc:Combinatory_logic dbc:1985_non-fiction_books dbc:Alfred_A._Knopf_books dbc:Puzzle_books |
| gold:hypernym | dbr:Book |
| rdf:type | owl:Thing yago:Artifact100021939 yago:Book106410904 yago:Creation103129123 yago:Object100002684 yago:PhysicalEntity100001930 yago:Product104007894 yago:Publication106589574 yago:Work104599396 dbo:Book yago:Whole100003553 yago:Wikicat1985Books yago:WikicatAlfredA.KnopfBooks yago:WikicatPuzzleBooks http://dbpedia.org/class/Book |
| rdfs:comment | 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. (en) |
| rdfs:label | To Mock a Mockingbird (en) |
| owl:differentFrom | dbr:To_Kill_a_Mockingbird |
| owl:sameAs | freebase:To Mock a Mockingbird yago-res:To Mock a Mockingbird http://www4.wiwiss.fu-berlin.de/bookmashup/books/0192801422 wikidata:To Mock a Mockingbird https://global.dbpedia.org/id/fXNF |
| prov:wasDerivedFrom | wikipedia-en:To_Mock_a_Mockingbird?oldid=1056799913&ns=0 |
| foaf:depiction | wiki-commons:Special:FilePath/To_Mock_a_Mockingbird.jpg |
| foaf:isPrimaryTopicOf | wikipedia-en:To_Mock_a_Mockingbird |
| is dbo:wikiPageRedirects of | dbr:To_mock_a_mocking_bird |
| is dbo:wikiPageWikiLink of | dbr:Combinatory_logic dbr:Logic_puzzle dbr:Lambda_calculus dbr:Recreational_mathematics dbr:B,_C,_K,_W_system dbr:Raymond_Smullyan dbr:SKI_combinator_calculus dbr:To_mock_a_mocking_bird |
| is foaf:primaryTopic of | wikipedia-en:To_Mock_a_Mockingbird |
