‎COPI, IRVING M.‎
‎Symbolic Logic.‎

‎[Church:] A note on the Entscheidungsproblem (+) Correction to A note on the Entscheidungsproblem (+) [Post:] Finite combinatory processes-formulation I. [In ""Journal of Symbolic Logic"", Volume 1, number 1 + 3, 1936] - [THE FOUNDATION FOR MODERN COMPUTER LOGIC]‎

‎Wisconsin, The Association for Symbolic Logic, 1936. Lev8vo. Entire volume one of ""Journal of Symbolic Logic"" (i.e. number 1-4), March, June, September, December 1936) BOUND WITH ALL THE ORIGINAL WRAPPERS in a blue half cloth with gilt lettering to spine. Crossed-out library paper-label to lower part of spine and top left corner of front board. Two library stamps (in Chinese) to back of front free end-paper. Chinese library-stamp (red) and stamped inventory-number lower part of all four front wrappers. Minor bumping to lower corner of nr. 4, otherwise internally a very fine and clean copy of the entire volume. [Church:] Pp. 40-1"" 101-2. [Post:] Pp. 103-5. [Entire volume: 218 pp.].‎

‎First publication of Church's seminal paper in which he proved the solution to David Hilbert's ""Entscheidungsproblem"" from 1928, namely that it is impossible to decide algorithmically whether statements within arithmetic are true or false. In showing that there is no general algorithm for determining whether or not a given statement is true or false, he not only solved Hilbert's ""Entscheidungsproblem"" but also laid the foundation for modern computer logic. This conclusion is now known as Church's Theorem or the Church-Turing Theorem (not to be mistaken with the Church-Turing Thesis). The present paper anticipates Turing's famous ""On Computable Numbers"" by a few months. ""Church's paper, submitted on April 15, 1936, was the first to contain a demonstration that David Hilbert's 'Entscheidungsproblem' - i.e., the question as to whether there exists in mathematics a definite method of guaranteeing the truth or falsity of any mathematical statement - was unsolvable. Church did so by devising the 'lambda-calculus', [...] Church had earlier shown the existence of an unsolvable problem of elementary number theory, but his 1936 paper was the first to put his findings into the exact form of an answer to Hilbert's 'Entscheidungsproblem'. Church's paper bears on the question of what is computable, a problem addressed more directly by Alan Turing in his paper 'On computable numbers' published a few months later. The notion of an 'effective' or 'mechanical' computation in logic and mathematics became known as the Church-Turing thesis."" (Hook & Norman: Origins of Cyberspace, 250) The volume also contains first printing of Post's seminal paper, in which he, simultaneously with but independently of Turing, describes a logic automaton, which very much resembles the Turing machine. The Universal Turing Machine, which is presented for the first time in Turing's seminal paper in the Proceedings of the London Mathematical Society for 1936, is considered one of the most important innovations in the theory of computation and constitutes the most famous theoretical paper in the history of computing. ""Post [in the present paper] suggests a computation scheme by which a ""worker"" can solve all problems in symbolic logic by performing only machinelike ""primitive acts"". Remarkably, the instructions given to the ""worker"" in Post's paper and to a Universal Turing Machine were identical."" (A Computer Perspective, p. 125).""The Polish-American mathematician Emil Post made notable contributions to the theory of recursive functions. In the 1930s, independently of Turing, Post came up with the concept of a logic automaton similar to a Turing machine, which he described in the present paper [the paper offered]. Post's paper was intended to fill a conceptual gap in Alonzo Churchs' paper on ""An unsolvable problem of elementary number theory"" (Americ. Journ. of Math. 58, 1936). Church's paper had answered in the negative Hilbert's question as to whether a definite method existed for proving the truth or falsity of any mathematical statement (the Entscheidungsproblem), but failed to provide the assertion that any such definite method could be expressed as a formula in Church's lambda-calculus. Post proposed that a definite method would be written in the form of instructions to a mindless worker operating on an infinite line of ""boxes"" (equivalent to Turing's machine's ""tape""). The worker would be capable only of reading the instructions and performing the following tasks... This range of tasks corresponds exactly to those performed by a Turing machine, and Church, who edited the ""Journal of Symbolic Logic"", felt it necessary to insert an editorial note referring to Turing's ""shortly forthcoming"" paper on computable numbers, and ascertaining that ""the present article... although bearing a later date, was written entirely independently of Turing's"" (p. 103)."" (Origins of Cyberspace, pp. 111-12).Even though Post's work to some degree has been outshined by Turing's, the present paper is of seminal importance in the history of the foundation for modern computer logic and the ideological basis for the modern computer.The volume also contains the following important papers by W. V. Quine:1. Toward a Calculus of Concepts. Pp. 2-25.2. Set-theoretic Foundations for Logic. Pp. 45-57.Hook & Norman, Origins of Cyberspace, 2002: 250 + 356 Charles & Ray Eames, A Computer Perspective, 1973: 125.‎

‎A Completeness Theorem in Modal Logic. [In: The Journal of Symbolic Logic. Edited by Alonza Church, Leon Henkin, S.C. Kleene, Alice A. Lezerowitz & Alfons Borgers. Volume 24, Number 1, March 1959]. - [KRIPKE MODELS FOR MODAL LOGIC]‎

‎(No place), The Association for Symbolic Logic, 1959. 8vo. Orig. printed wrappers. An excellent copy in near mint condition, in- as well as externally. Pp. (1) - 14. (The entire volume: 96 pp.).‎

‎The seminal first printing of Kripke's debut article, which provided the basis for his logic and for the model theory for modal logic in general. The work constitutes the very beginning of Kripke Semantics (often called possible world semantics). Kripke's works in general are rare in fist editions. Many of them remain unpublished and are only known in privately circulated manuscripts.The American philosopher Saul A. Kripke (born 1940) is an exceedingly important logician and philosopher of language and one of the most powerful and influential thinkers of analytic and Anglo-American philosophy. He is considered the greatest living philosopher and perhaps the greatest since Wittgenstein. In 2001 he was awarded the Schock Prize in Logic and Philosophy, which is considered the philosopical equivalent of the Nobel Prize.Kripke, who grew up in Omaha in a religious Jewish family, was somewhat of a prodigy child. During grammar school he got intimately acquainted with and mastered to perfection algebra, geometry and calculus, and very early on he took up philosophy, which later became his career. Still a teenager, in high school, he wrote a work that was to change the face of philosophical logic forever, namely the groundbreaking paper ""A Completeness Theorem for Modal Logic"", which was printed a few years later, in 1959, in the Journal of Symbolic Logic, while he was in his first year at Harvard University. This seminal debut work proposed what later came to be known as Kripke models for modal logic. The story goes that the paper earned a letter from the department of mathematics urging Kripke to apply for a job there, to which he is said to have written an answer explaining ""My mother said that I should finish high school and go to college first.""In 1962 he graduated from Harvard University, where he remained until 1968, first as a member of the Harvard Society of Fellows and then as a lecturer. During these years he developed the logical theories founded in the ""Completeness Theorem"" further and made seminal contributions to the field of logic and semantics. Kripke Semantics is a formal semantics for non-classical logic systems that Kripke began developing in his teenage years, first published something on in 1959 (the present work) and further developed in the 60'ies and. The development of Kripke Semantics was no less than a breakthrough in the making of non-classical logics, of which no model theory existed before Kripke's. With this work, Kripke laid the foundation for proving completeness theorems for modal logic, and for identifying the weakest normal modal logic, which is now named K after him.‎

‎A Completeness Theorem in Modal Logic. [In: The Journal of Symbolic Logic. Edited by Alonza Church, Leon Henkin, S.C. Kleene, Alice A. Lezerowitz & Alfons Borgers. Volume 24, Number 1, March 1959].‎

‎(No place), The Association for Symbolic Logic, 1959. 8vo. Wrappers blank with printed title on spine. Entire issue No. 1 of vol. 24, offered. Fine and clean.‎

‎The seminal first printing of Kripke's debut article, which provided the basis for his logic and for the model theory for modal logic in general. The work constitutes the very beginning of Kripke Semantics (often called possible world semantics). Kripke's works in general are rare in fist editions. Many of them remain unpublished and are only known in privately circulated manuscripts.The American philosopher Saul A. Kripke (born 1940) is an exceedingly important logician and philosopher of language and one of the most powerful and influential thinkers of analytic and Anglo-American philosophy. He is considered the greatest living philosopher and perhaps the greatest since Wittgenstein. In 2001 he was awarded the Schock Prize in Logic and Philosophy, which is considered the philosopical equivalent of the Nobel Prize.Kripke, who grew up in Omaha in a religious Jewish family, was somewhat of a prodigy child. During grammar school he got intimately acquainted with and mastered to perfection algebra, geometry and calculus, and very early on he took up philosophy, which later became his career. Still a teenager, in high school, he wrote a work that was to change the face of philosophical logic forever, namely the groundbreaking paper ""A Completeness Theorem for Modal Logic"", which was printed a few years later, in 1959, in the Journal of Symbolic Logic, while he was in his first year at Harvard University. This seminal debut work proposed what later came to be known as Kripke models for modal logic. The story goes that the paper earned a letter from the department of mathematics urging Kripke to apply for a job there, to which he is said to have written an answer explaining ""My mother said that I should finish high school and go to college first.""In 1962 he graduated from Harvard University, where he remained until 1968, first as a member of the Harvard Society of Fellows and then as a lecturer. During these years he developed the logical theories founded in the ""Completeness Theorem"" further and made seminal contributions to the field of logic and semantics. Kripke Semantics is a formal semantics for non-classical logic systems that Kripke began developing in his teenage years, first published something on in 1959 (the present work) and further developed in the 60'ies and. The development of Kripke Semantics was no less than a breakthrough in the making of non-classical logics, of which no model theory existed before Kripke's. With this work, Kripke laid the foundation for proving completeness theorems for modal logic, and for identifying the weakest normal modal logic, which is now named K after him.‎

‎Journal of Symbolic Logic, Volume 16, 1951.‎

‎(No place), The Association for Symbolic Logic, 1951. Lev8vo. Bound in red half cloth with gilt lettering to spine. ""Journal of Symbolic Logic"", Volume 16. Barcode label pasted on to back board. Small library stamp to lower part of 6 pages. A very fine copy. IV, 332 pp.).‎

‎Identity, Variables, and Impredicative Definitions + Vicious Circle Principles and the Paradoxes. (In Journal of Symbolic Logic. - [HINTIKKA'S TRANSFORMATION RULES]‎

‎(No place), The Association for Symbolic Logic, Inc., 1956 + 1957. 8vo. Bound with the original wrappers in contemporary full cloth with black title label in leather with gilt lettering to spine. In ""Journal of Symbolic Logic"", Volume 21, Number 3, 1956 + Volume 22, Number 3, 1957. Small tear to lower right corner of back wrapper of volume 21 and front wrapper of volume 22. Small repair on back wrapper of volume 22. Otherwise a very fine and clean set. Pp. 225-248" Pp. 245-249 [entire issue: Pp. 225-336" Pp. 225-336].‎

‎First printing of these two important, but for long overlooked, articles, which together constitute Hintikka's attempt to cope with Wittgenstein's elimination of identity as proposed in the ""Tractatus"". With the translation rules that Hintikka here put forward, he is the first to try to carry out Wittgenstein's suggestions systematically. The Finnish born philosopher and logician, Jaakko Hintikka (born 1929), Professor of Philosophy at the University of Boston, is generally accepted as the founder of formal epistemic logic and of game semantics for logic. He has contributed seminally to the fields of philosophical and mathematical logic, philosophy of mathematics and science, language theory and epistemology. Independently of Evert Willem Beth he discovered the semantic tableau, and he is famous for his work on game semantics and logical quantifiers. In 2005 Hintakka was awarded the Schock Prize in logic and philosophy, the philosophical equivalent to the Nobel prize, ""for his pioneering contributions to the logical analysis of modal concepts, in particular the concepts of knowledge and belief "". In the 1950'ies Hintikka took it upon himself to follow Wittgentein's suggestion of elimination of identity suggested in the ""tractatus"", and in the two offered articles, he succeeds in constructing a logic without identity. The main point of the two connected articles is to show that variables can be used in two ways. One way does not exclude coincidences of the values of different variables (inclusive interpretation of variables), the other does (exclusive interpretation of variables) and can be either weakly or strongly exclusive. He now claims that in the ""Tractatus"" Wittgenstein adopts the weakly exclusive interpretation of variable and then proves that the weakly exclusive quantifiers are able to express everything that the inclusive quantifiers plus identity can express, and without a sign for identity, - for the first time systematically supporting Wittgenstein's claim that identity is not an essential constituent of logical notation. ""There are a number of references to the exclusive interpretations of variables in current logical literature. An exclusive reading of variables was, in effect, suggested by Ludwig Wittgenstein in ""Tractatus logico-philosophicus. As far as I know, however, no one has previously tried to carry out his suggestions systematically. Several misconceptions seem to be current concerning the outcome of an attempts of this kind. Carnap expects radical changes in the rules of substitution. If I am not mistaken, however, at least one form of the exclusive interpretation may be formalized by making but slight alterations in the axioms and/or in the transformation rules of the predicate calculus. Also I hope to say that it is not correct to say (as Russell has done) that Wittgenstein tried to dispense with the notion of identity. What a systematic use of an exclusive reading of variables amounts to is a new way of coping with the notion of identity in a formalized system of logic. Under the most natural formalization of the new interpretations, the resulting system is equivalent to the old predicate calculus (with identity): every formula of the latter admits of a translation into the former, and vice versa."" (Vol. 21, Nr. 3, p. 228).""A deviation from standard English. Recent discussion serves to bring out, amply and convincingly, the utility of observing the ordinary correct use of words and phrases for the purpose of clearing up philosophical problems. In this paper, I shall endeavour to show, by means of an example, that the reverse method may have its interest, too. "" (Vol. 21, Nr. 3, p. 225). ""This note is a sequel to the previous paper of mine which was entitled ""Identity, variables, and impredicative definitions"" and published in this JOURNAL, vol. 21 (1956, pp. 225-245. That early paper served to call attention to the dependency of the set-theoretic paradoxes on the interpretation of the variables that may occur in the critical ""abstraction principle"". (Vol. 22, Nr. 3, p. 245).Besides these two articles, the two issues also include other important articles within logic, e.g. Quine, ""Unification of Universes in Set Theory"" and Symonds and Chisholm ""Inference by Complementary Elimination"".‎