The Correspondence Between Alfred Tarski and Joseph H. Woodger
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Russell's 1903 – 1905 Anticipation of the Lambda Calculus
HISTORY AND PHILOSOPHY OF LOGIC, 24 (2003), 15–37 Russell’s 1903 – 1905 Anticipation of the Lambda Calculus KEVIN C. KLEMENT Philosophy Dept, Univ. of Massachusetts, 352 Bartlett Hall, 130 Hicks Way, Amherst, MA 01003, USA Received 22 July 2002 It is well known that the circumflex notation used by Russell and Whitehead to form complex function names in Principia Mathematica played a role in inspiring Alonzo Church’s ‘Lambda Calculus’ for functional logic developed in the 1920s and 1930s. Interestingly, earlier unpublished manuscripts written by Russell between 1903 and 1905—surely unknown to Church—contain a more extensive anticipation of the essential details of the Lambda Calculus. Russell also anticipated Scho¨ nfinkel’s Combinatory Logic approach of treating multi- argument functions as functions having other functions as value. Russell’s work in this regard seems to have been largely inspired by Frege’s theory of functions and ‘value-ranges’. This system was discarded by Russell due to his abandonment of propositional functions as genuine entities as part of a new tack for solving Rus- sell’s paradox. In this article, I explore the genesis and demise of Russell’s early anticipation of the Lambda Calculus. 1. Introduction The Lambda Calculus, as we know it today, was initially developed by Alonzo Church in the late 1920s and 1930s (see, e.g. Church 1932, 1940, 1941, Church and Rosser 1936), although it built heavily on work done by others, perhaps most notably, the early works on Combinatory Logic by Moses Scho¨ nfinkel (see, e.g. his 1924) and Haskell Curry (see, e.g. -
Haskell Before Haskell. an Alternative Lesson in Practical Logics of the ENIAC.∗
Haskell before Haskell. An alternative lesson in practical logics of the ENIAC.∗ Liesbeth De Mol† Martin Carl´e‡ Maarten Bullynck§ January 21, 2011 Abstract This article expands on Curry’s work on how to implement the prob- lem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program composition (1948-1950). It is shown that Curry’s hands-on experience with the ENIAC on the one side and his acquaintance with systems of formal logic on the other, were conduc- tive to conceive a compact “notation for program construction” which in turn would be instrumental to a mechanical synthesis of programs. Since Curry’s systematic programming technique pronounces a critique of the Goldstine-von Neumann style of coding, his “calculus of program com- position”not only anticipates automatic programming but also proposes explicit hardware optimisations largely unperceived by computer history until Backus famous ACM Turing Award lecture (1977). This article frames Haskell B. Curry’s development of a general approach to programming. Curry’s work grew out of his experience with the ENIAC in 1946, took shape by his background as a logician and finally materialised into two lengthy reports (1948 and 1949) that describe what Curry called the ‘composition of programs’. Following up to the concise exposition of Curry’s approach that we gave in [28], we now elaborate on technical details, such as diagrams, tables and compiler-like procedures described in Curry’s reports. We also give a more in-depth discussion of the transition from Curry’s concrete, ‘hands-on’ experience with the ENIAC to a general theory of combining pro- grams in contrast to the Goldstine-von Neumann method of tackling the “coding and planning of problems” [18] for computers with the help of ‘flow-charts’. -
The Delphi Method: Techniques and Applications from the Foreword by Olaf Helmer
The Delphi Method Techniques and Applications Edited by Harold A. Linstone Portland State University Murray Turoff New Jersey Institute of Technology With a Foreword by Olaf Helmer University of Southern California ©2002 Murray Turoff and Harold A. Linstone I. Introduction I. Introduction HAROLD A. LINSTONE and MURRAY TUROFF General Remarks It is common, in a book of this kind, to begin with a detailed and explicit definition of the subject- the Delphi technique. However, if we were to attempt this, the reader would no doubt encounter at least one contribution to this collection which would violate our definition. There is in addition a philosophical perspective that when something has attained a point at which it is explicitly definable, then progress has stopped; such is the view we hold with respect to Delphi. In 1969 the number of Delphi studies that had been done could be counted in three digits; today, in 1974, the figure may have already reached four digits. The technique and its application are in a period of evolution, both with respect to how it is applied and to what it is applied. It is the objective of this book to expose the richness of what may be viewed as an evolving field of human endeavor. The reader will encounter in these pages many different perspectives on the Delphi method and an exceedingly diverse range of applications. For a technique that can be considered to be in its infancy, it would be presumptuous of us to present Delphi in the cloak of a neatly wrapped package, sitting on the shelf and ready to use, Rather, we have adopted the approach, through our selection of contributions, of exhibiting a number of different objects having the Delphi label and inviting you to sculpt from these examples your own view and assessment of the technique. -
How to Train Your Oracle: the Delphi Method and Its Turbulent Youth in Operations Research and the Policy Sciences
SSS0010.1177/0306312718798497Social Studies of ScienceDayé 798497research-article2018 Article Social Studies of Science 1 –23 How to train your oracle: © The Author(s) 2018 Article reuse guidelines: The Delphi method and its sagepub.com/journals-permissions https://doi.org/10.1177/0306312718798497DOI: 10.1177/0306312718798497 turbulent youth in operations journals.sagepub.com/home/sss research and the policy sciences Christian Dayé Department of Sociology, Alpen-Adria-Universität Klagenfurt, Klagenfurt, Austria Abstract Delphi is a procedure that produces forecasts on technological and social developments. This article traces the history of Delphi’s development to the early 1950s, where a group of logicians and mathematicians working at the RAND Corporation carried out experiments to assess the predictive capacities of groups of experts. While Delphi now has a rather stable methodological shape, this was not so in its early years. The vision that Delphi’s creators had for their brainchild changed considerably. While they had initially seen it as a technique, a few years later they reconfigured it as a scientific method. After some more years, however, they conceived of Delphi as a tool. This turbulent youth of Delphi can be explained by parallel changes in the fields that were deemed relevant audiences for the technique, operations research and the policy sciences. While changing the shape of Delphi led to some success, it had severe, yet unrecognized methodological consequences. The core assumption of Delphi that the convergence of expert opinions observed over the iterative stages of the procedure can be interpreted as consensus, appears not to be justified for the third shape of Delphi as a tool that continues to be the most prominent one. -
Strategic Maneuvering in Mathematical Proofs
CORE Metadata, citation and similar papers at core.ac.uk Provided by Springer - Publisher Connector Argumentation (2008) 22:453–468 DOI 10.1007/s10503-008-9098-7 Strategic Maneuvering in Mathematical Proofs Erik C. W. Krabbe Published online: 6 May 2008 Ó The Author(s) 2008 Abstract This paper explores applications of concepts from argumentation theory to mathematical proofs. Note is taken of the various contexts in which proofs occur and of the various objectives they may serve. Examples of strategic maneuvering are discussed when surveying, in proofs, the four stages of argumentation distin- guished by pragma-dialectics. Derailments of strategies (fallacies) are seen to encompass more than logical fallacies and to occur both in alleged proofs that are completely out of bounds and in alleged proofs that are at least mathematical arguments. These considerations lead to a dialectical and rhetorical view of proofs. Keywords Argumentation Á Blunder Á Fallacy Á False proof Á Mathematics Á Meno Á Pragma-dialectics Á Proof Á Saccheri Á Strategic maneuvering Á Tarski 1 Introduction The purport of this paper1 is to show that concepts from argumentation theory can be fruitfully applied to contexts of mathematical proof. As a source for concepts to be tested I turn to pragma-dialectics: both to the Standard Theory and to the Integrated Theory. The Standard Theory has been around for a long time and achieved its final formulation in 2004 (Van Eemeren and Grootendorst 1984, 1992, 2004). According to the Standard Theory argumentation is a communication process aiming at 1 The paper was first presented at the NWO-conference on ‘‘Strategic Manoeuvring in Institutionalised Contexts’’, University of Amsterdam, 26 October 2007. -
Hunting the Story of Moses Schönfinkel
Where Did Combinators Come From? Hunting the Story of Moses Schönfinkel Stephen Wolfram* Combinators were a key idea in the development of mathematical logic and the emergence of the concept of universal computation. They were introduced on December 7, 1920, by Moses Schönfinkel. This is an exploration of the personal story and intellectual context of Moses Schönfinkel, including extensive new research based on primary sources. December 7, 1920 On Tuesday, December 7, 1920, the Göttingen Mathematics Society held its regular weekly meeting—at which a 32-year-old local mathematician named Moses Schönfinkel with no known previous mathematical publications gave a talk entitled “Elemente der Logik” (“Elements of Logic”). This piece is included in S. Wolfram (2021), Combinators: A Centennial View, Wolfram Media. (wolframmedia.com/products/combinators-a-centennial-view.html) and accompanies arXiv:2103.12811 and arXiv:2102.09658. Originally published December 7, 2020 *Email: [email protected] 2 | Stephen Wolfram A hundred years later what was presented in that talk still seems in many ways alien and futuristic—and for most people almost irreducibly abstract. But we now realize that that talk gave the first complete formalism for what is probably the single most important idea of this past century: the idea of universal computation. Sixteen years later would come Turing machines (and lambda calculus). But in 1920 Moses Schönfinkel presented what he called “building blocks of logic”—or what we now call “combinators”—and then proceeded to show that by appropriately combining them one could effectively define any function, or, in modern terms, that they could be used to do universal computation. -
CURRY, Haskell Brooks (1900–1982) Haskell Brooks Curry Was Born On
CURRY, Haskell Brooks (1900–1982) Haskell Brooks Curry was born on 12 September 1900 at Millis, Massachusetts and died on 1 September 1982 at State College, Pennsylvania. His parents were Samuel Silas Curry and Anna Baright Curry, founders of the School for Expression in Boston, now known as Curry College. He graduated from high school in 1916 and entered Harvard College with the intention of going into medicine. When the USA entered World War I in 1917, he changed his major to mathematics because he thought it might be useful for military purposes in the artillery. He also joined the Student Army Training Corps on 18 October 1918, but the war ended before he saw action. He received his B.A. in mathematics from Harvard University in 1920. From 1920 until 1922, he studied electrical engineering at MIT in a program that involved working half-time at the General Electric Company. From 1922 until 1924, he studied physics at Harvard; during the first of those two years he was a half-time research assistant to P. W. Bridgman, and in 1924 he received an A. M. in physics. He then studied mathematics, still at Harvard, until 1927; during the first semester of 1926–27 he was a half-time instructor. During 1927–28 he was an instructor at Princeton University. During 1928–29, he studied at the University of Göttingen, where he wrote his doctoral dissertation; his oral defense under David Hilbert was on 24 July 1929, although the published version carries the date of 1930. In the fall of 1929, Haskell Curry joined the faculty of The Pennsylvania State College (now The Pennsylvania State University), where he spent most of the rest of his career. -
Kazimierz Kuratowski (Warsaw)
Kazimierz Kuratowski (Warsaw) THE PAST AND THE PRESENT OF THE POLISH SCHOOL OF MATHEMATICS I am concentrating in this article on two main subjects. Firstly: I am trying to answer the question what brought about such an “explosion” of mathematics in a country in whose scientific tradition there was hardly any mathematics and which happened at the time when after an over-one-century-long foreign rule the nation was trying hard to reconstruct its now independent country, ravaged by the First World War. Secondly: was this explosion a short-lived enthusiasm or, on the contrary, the Polish school of .mathematics struck roots so deeply that it was sub sequently able to survive the cataclysm of the Second World War and rebuild in the new circumastances — in People’s Poland — the internationally re cognized edifice of Polish mathematics? There will be in this article no mathematical theorems, no definitions or geometrical constructions. I shall be trying to use the language which can be understood without mathematical qualifications. It is therefore my hope that this text will be intelligible not only to mathematicians.1 1. PRECURSORS OF THE POLISH SCHOOL OF MATHEMATICS It was the years 1918—1920 when the Polish School of Mathematics was emerging. Before describing this period and the subsequent years one should, I think, review, be it only summarily, the contemporary state of Polish mathematics. I am going to mention those of its representatives the majority of whom had in fact been active in the 19th century but who also worked in the 20th century and so could influence the formation of the School of Mathematics being thus its precursors as it were. -
On Diagonal Argument. Russell Absurdities and an Uncountable Notion of Lingua Characterica
ON DIAGONAL ARGUMENT. RUSSELL ABSURDITIES AND AN UNCOUNTABLE NOTION OF LINGUA CHARACTERICA JAMES DOUGLASS KING Bachelor of Arts, University of Lethbridge, 1996 A Thesis Submitted to the School of Graduate Studies of the University of Lethbridge in Partial Fulfillment of the Requirements for the Degree MASTER OF ARTS Department of Philosophy University of Lethbridge LETHBRIDGE, ALBERTA, CANADA © James Douglass King, 2004 ABSTRACT There is an interesting connection between cardinality of language and the distinction of lingua characterica from calculus rationator. Calculus-type languages have only a countable number of sentences, and only a single semantic valuation per sentence. By contrast, some of the sentences of a lingua have available an uncountable number of semantic valuations. Thus, the lingua-type of language appears to have a greater degree of semantic universality than that of a calculus. It is suggested that the present notion of lingua provides a platform for a theory of ambiguity, whereby single sentences may have multiply - indeed, uncountably - many semantic valuations. It is further suggested that this might lead to a pacification of paradox. This thesis involves Peter Aczel's notion of a universal syntax, Russell's question, Keith Simmons* theory of diagonal argument, Curry's paradox, and a 'Leibnizian' notion of language. iii ACKNOWLEDGEMENTS The following people are due great thanks and gratitude for their constant support and understanding over the considerable time that it took to develop this thesis. They are each sine qua non of my success. Bryson Brown has supported my efforts from beginning to end, since my undergraduate studies when I first found my love of logic and philosophy; he also brought me to understand much that I have otherwise found obscure and/or irrelevant, and he provided important moral support. -
Contribution of Warsaw Logicians to Computational Logic
axioms Article Contribution of Warsaw Logicians to Computational Logic Damian Niwi ´nski Institute of Informatics, University of Warsaw, 02-097 Warsaw, Poland; [email protected]; Tel.: +48-22-554-4460 Academic Editor: Urszula Wybraniec-Skardowska Received: 22 April 2016; Accepted: 31 May 2016; Published: 3 June 2016 Abstract: The newly emerging branch of research of Computer Science received encouragement from the successors of the Warsaw mathematical school: Kuratowski, Mazur, Mostowski, Grzegorczyk, and Rasiowa. Rasiowa realized very early that the spectrum of computer programs should be incorporated into the realm of mathematical logic in order to make a rigorous treatment of program correctness. This gave rise to the concept of algorithmic logic developed since the 1970s by Rasiowa, Salwicki, Mirkowska, and their followers. Together with Pratt’s dynamic logic, algorithmic logic evolved into a mainstream branch of research: logic of programs. In the late 1980s, Warsaw logicians Tiuryn and Urzyczyn categorized various logics of programs, depending on the class of programs involved. Quite unexpectedly, they discovered that some persistent open questions about the expressive power of logics are equivalent to famous open problems in complexity theory. This, along with parallel discoveries by Harel, Immerman and Vardi, contributed to the creation of an important area of theoretical computer science: descriptive complexity. By that time, the modal m-calculus was recognized as a sort of a universal logic of programs. The mid 1990s saw a landmark result by Walukiewicz, who showed completeness of a natural axiomatization for the m-calculus proposed by Kozen. The difficult proof of this result, based on automata theory, opened a path to further investigations. -
Functional Programming and Verification
Functional Programming and Verification Tobias Nipkow Fakult¨atf¨urInformatik TU M¨unchen http://fpv.in.tum.de Wintersemester 2019/20 January 30, 2020 1 Sprungtabelle 18. Oktober 25. Oktober 08. November 15. November 22. November 29. November 06. December 13. Dezember 19. Dezember 10. Januar 17. Januar 24. Januar 31. Januar 2 1 Functional Programming: The Idea 2 Basic Haskell 3 Lists 4 Proofs 5 Higher-Order Functions 6 Type Classes 7 Algebraic data Types 8 I/O 9 Modules and Abstract Data Types 10 Case Study: Two Efficient Algorithms 11 Lazy evaluation 12 Monads 13 Complexity and Optimization 14 Case Study: Parsing 3 0. Organisatorisches 4 Siehe http://fpv.in.tum.de 6 Literatur • Vorlesung orientiert sich stark an Thompson: Haskell, the Craft of Functional Programming • F¨urFreunde der kompakten Darstellung: Hutton: Programming in Haskell • F¨urNaturtalente: Es gibt sehr viel Literatur online. Qualit¨atwechselhaft, nicht mit Vorlesung abgestimmt. 7 Klausur und Hausaufgaben • Klausur am Ende der Vorlesung • Notenbonus mit Hausaufgaben: siehe WWW-Seite Wer Hausaufgaben abschreibt oder abschreiben l¨asst, hat seinen Notenbonus sofort verwirkt. • Hausaufgabenstatistik: Wahrscheinlichkeit, die Klausur (oder W-Klausur) zu bestehen: • ≥ 40% der Hausaufgabenpunkte =) 100% • < 40% der Hausaufgabenpunkte =) < 50% • Aktueller pers¨onlicherPunktestand im WWW ¨uber Statusseite 8 Programmierwettbewerb | Der Weg zum Ruhm • Jede Woche eine Wettbewerbsaufgabe • Punktetabellen im Internet: • Die Top 30 jeder Woche • Die kumulative Top 30 • Ende des Semesters: -
1 on the Life and Work of Andrzej Mostowski? STANISŁAW
On the life and work of Andrzej Mostowski ? STANISŁAW KRAJEWSKI and MARIAN SREBRNY (Warsaw, Poland) Andrzej Stanisław Mostowski was born on November 1, 1913, in Lwów. His father, Stanisław Mostowski, was a medical doctor and worked as an assistant at the Physical Chemistry Department of the University of Lwów; he was conscripted in 1914 as a military doctor and soon after died of typhus. The family had to be provided for by the mother, Zofia née Kramsztyk (1881-1963), who worked for many years in a bank. Andrzej (by his mother called Staszek after the father) had one sister Krystyna (after the war she settled abroad – first in France, then in Montreal). In the summer of 1914 Mostowski’s mother went with her children to Zakopane to spend holidays there; in the face of the outbreak of war and the death of the father they ? This text is translated from its Polish original published in “Wiadomo ści matematyczne”, Annales Societatis Mathematicae Polonae XXII.1 (1979), pp. 53-64, updated slightly where necessary. It is meant to present solely the events of Andrzej Mostowski’s biography. We do not discuss the content of his scientific output as such (other articles are devoted to it), but only provide some information on when he was involved in what and when his major works were created. The information included in this article have been taken from three following sources. Firstly, from the existing publications on the life and scientific output of Andrzej Mostowski. They are listed at the end of this text. The article by S.