Logic, Meaning and Computation: Essays in Memory of Alonzo ChurchSpringer Science & Business Media, 2001 - 627 pàgines Alonzo Church was undeniably one ofthe intellectual giants of theTwenti- eth Century . These articles are dedicated to his memory and illustrate the tremendous importance his ideas have had in logic, mathematics, comput er science and philosophy . Discussions of some of thesevarious contributions have appeared in The Bulletin of Symbolic Logic, and th e interested reader is invited to seek details there . Here we justtry to give somegener al sense of the scope, depth, and value of his work. Church is perhaps best known for the theorem, appropriately called " C h u r c h's Theorem ", that there is no decision procedure forthelogical valid- ity of formulas first-order of logic . A d ecision proce dure forthat part of logic would have come near to fulfilling Leibniz's dream of a calculus that could be mechanically used tosettle logical disputes . It was not to . be It could not be . What Church proved precisely is that there is no lambda-definable function that can i n every case providethe right answer, ' y e s ' or ' n o', tothe question of whether or not any arbitrarily given formula is valid . |
Altres edicions - Mostra-ho tot
Logic, Meaning and Computation: Essays in Memory of Alonzo Church C. Anthony Anderson,Michael Zelëny Previsualització limitada - 2012 |
Logic, Meaning and Computation C. Anthony Anderson,Michael Zeleny Previsualització no disponible - 2014 |
Logic, Meaning and Computation: Essays in Memory of Alonzo Church C. Anthony Anderson,Michael Zelëny Previsualització no disponible - 2012 |
Frases i termes més freqüents
a₁ abstraction Alonzo Church analysis Anderson Anthony Anderson argument arithmetic atomic axiom axiomatization binary Boolean calculus Church Church's Theorem classical complete computable concept constant construction context defined definition denotation domain element epistemic equality formula example expressed ɛ t+ ɛ tx false finite first-order logic formal Frege Fregean given hence identity induction infinite intensional interpretation ISBN isomorphism L-structure lambda lambda calculus Leibniz Lemma low set maps mathematical meaning Meyer monoid natural language natural numbers negation notation notion objects ontology paradox paradox of analysis Peano permutation Philosophy of Science predicate primitive recursive problem Proof propositional functions quantifiers relation algebra relevance logic relevant second-order second-order logic semantics sense sentence sequence set theory Skolem structure subset Suppose synonymous synonymy syntactic t₁ thesis translation true truth values University variables Zermelo