APA PsycNET abstract: This is the first volume of a two-volume work on Probability and Induction. Because the writer holds that probability logic is identical with inductive logic, this work is devoted to philosophical problems concerning the nature of probability and inductive reasoning. The author rejects a statistical frequency basis for probability in favor of a logical relation between two statements or propositions. Probability "is the degree of confirmation of a hypothesis (or conclusion) on the basis of some given evidence (...) (or premises)." Furthermore, all principles and theorems of inductive logic are analytic, and the entire system is to be constructed by means of symbolic logic and semantic methods. This means that the author confines himself to the formalistic procedures of word and symbol systems. The resulting sentence or language structures are presumed to separate off logic from all subjectivist or psychological elements. Despite the abstractionism, the claim is made that if an inductive probability system of logic can be constructed it will have its practical application in mathematical statistics, and in various sciences. 16-page bibliography. (PsycINFO Database Record (c) 2016 APA, all rights reserved). (shrink)

Cantor’s theory of cardinal numbers offers a way to generalize arithmetic from finite sets to infinite sets using the notion of one-to-one association between two sets. As is well known, all countable infinite sets have the same ‘size’ in this account, namely that of the cardinality of the natural numbers. However, throughout the history of reflections on infinity another powerful intuition has played a major role: if a collectionAis properly included in a collectionBthen the ‘size’ ofAshould be less than the (...) ‘size’ ofB(part–whole principle). This second intuition was not developed mathematically in a satisfactory way until quite recently. In this article I begin by reviewing the contributions of some thinkers who argued in favor of the assignment of different sizes to infinite collections of natural numbers (Thabit ibn Qurra, Grosseteste, Maignan, Bolzano). Then, I review some recent mathematical developments that generalize the part–whole principle to infinite sets in a coherent fashion (Katz, Benci, Di Nasso, Forti). Finally, I show how these new developments are important for a proper evaluation of a number of positions in philosophy of mathematics which argue either for the inevitability of the Cantorian notion of infinite number (Gödel) or for the rational nature of the Cantorian generalization as opposed to that, based on the part–whole principle, envisaged by Bolzano (Kitcher). (shrink)

Sets are central to mathematics and its foundations, but what are they? In this book Luca Incurvati provides a detailed examination of all the major conceptions of set and discusses their virtues and shortcomings, as well as introducing the fundamentals of the alternative set theories with which these conceptions are associated. He shows that the conceptual landscape includes not only the naïve and iterative conceptions but also the limitation of size conception, the definite conception, the stratified conception and the graph (...) conception. In addition, he presents a novel, minimalist account of the iterative conception which does not require the existence of a relation of metaphysical dependence between a set and its members. His book will be of interest to researchers and advanced students in logic and the philosophy of mathematics. (shrink)

Many of our concepts are introduced to us via, and seem only to be constrained by, roughand-ready explanations and some sample paradigm positive and negative applications. This happens even in informal logic and mathematics. Yet in some cases, the concepts in question – although only informally and vaguely characterized – in fact have, or appear to have, entirely determinate extensions. Here’s one familiar example. When we start learning computability theory, we are introduced to the idea of an algorithmically computable function (...) (from numbers to numbers) – i.e. one whose value for any given input can be determined by a step-by-step calculating procedure, where each step is fully determined by some antecedently given finite set of calculating rules. We are told that we are to abstract from practical considerations of how many steps will be needed and how much ink will be spilt in the process, so long as everything remains finite. We are also told that each step is to be ‘small’ and the rules governing it must be ‘simple’, available to a cognitively limited calculating agent: for we want an algorithmic procedure, step-by-minimal-step, to be idiot-proof. For a classic elucidation of this kind, see e.g. Rogers (1967, pp. 1–5). Church’s Thesis, in one form, then claims this informally explicated concept in fact has a perfectly precise extension, the set of recursive functions. Church’s Thesis can be supported in a quasi-empirical way, by the failure of our searches for counterexamples. It can be supported too in a more principled way, by the observation that different appealing ways of sharpening up the informal chararacterization of algorithmic computability end up specifying the same set of recursive functions. But such considerations fall short of a demonstration of the Thesis. So is there a different argumentative strategy we could use, one that could lead to a proof? Sometimes it is claimed that there just can’t be, because you can never really prove results involving an informal concept like algorithmic computability.. (shrink)

Using Carnap’s concept explication, we propose a theory of concept formation in mathematics. This theory is then applied to the problem of how to understand the relation between the concepts formal proof and informal, mathematical proof.

Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ (...) -definability as he had done in 1934? A number of letters were exchanged between Church and Paul Bernays during the period from December 1934 to August 1937; they throw light on critical developments in Princeton during that period and reveal novel aspects of Church's distinctive contribution to the analysis of the informal notion of effective calculability. In particular, they allow me to give informed, though still tentative answers to the questions I raised; the character of my answers is reflected by an alternative title for this paper, Why Church needed Gödel's recursiveness for his Thesis. In Section 5, I contrast Church's analysis with that of Alan Turing and explore, in the very last section, an analogy with Dedekind's investigation of continuity. (shrink)

Wilfried Sieg and John Byrnes. AnModel for Parallel Computation: Gandy's Thesis.

The rise of experimental philosophy has placed metaphilosophical questions, particularly those concerning concepts, at the center of philosophical attention. X-phi offers empirically rigorous methods for identifying conceptual content, but what exactly it contributes towards evaluating conceptual content remains unclear. We show how x-phi complements Rudolf Carnap’s underappreciated methodology for concept determination, explication. This clarifies and extends x-phi’s positive philosophical import, and also exhibits explication’s broad appeal. But there is a potential problem: Carnap’s account of explication was limited to empirical and (...) logical concepts, but many concepts of interest to philosophers are essentially normative. With formal epistemology as a case study, we show how x-phi assisted explication can apply to normative domains. (shrink)

Turing and Church formulated two different formal accounts of computability that turned out to be extensionally equivalent. Since the accounts refer to different properties they cannot both be adequate conceptual analyses of the concept of computability. This insight has led to a discussion concerning which account is adequate. Some authors have suggested that this philosophical debate—which shows few signs of converging on one view—can be circumvented by regarding Church’s and Turing’s theses as explications. This move opens up the possibility that (...) both accounts could be adequate, albeit in their own different ways. In this paper, I focus on the question of whether Church’s thesis can be seen as an explication in the precise Carnapian sense. Most importantly, I address an additional constraint that Carnap puts on the explicative power of axiomatic systems—an axiomatisation explicates when it is clear which mathematical entities form the theory’s intended model—and that implicitly applies to axiomatisations of recursion theory used in Church’s account of computability. To overcome this difficulty, I propose two possible clarifications of the pre-systematic concept of “computability” that can both be captured in recursion theory, and I show how both clarifications avoid an objection arising from Carnap’s constraint. (shrink)

Explication is the conceptual cornerstone of Carnap’s approach to the methodology of scientific analysis. From a philosophical point of view, it gives rise to a number of questions that need to be addressed, but which do not seem to have been fully addressed by Carnap himself. This paper reconsiders Carnapian explication by comparing it to a different approach: the ‘formalisms as cognitive tools’ conception. The comparison allows us to discuss a number of aspects of the Carnapian methodology, as well as (...) issues pertaining to formalization in general. We start by introducing Carnap’s conception of explication, arguing that there is a tension between his proposed criteria of fruitfulness and similarity; we also argue that his further desideratum of exactness is less crucial than might appear at first. We then bring in the general idea of formalisms as cognitive tools, mainly by discussing the reliability of so-called statistical prediction rules, i.e. simple algorithms used to make predictions across a range of areas. SPRs allow for a concrete instantiation of Carnap’s fruitfulness desideratum, which is arguably the most important desideratum for him. Finally, we elaborate on what we call the ‘paradox of adequate formalization’, which for the Carnapian corresponds to the tension between similarity and fruitfulness. We conclude by noting that formalization is an inherently paradoxical enterprise in general, but one worth engaging in given the ‘cognitive boost’ it affords as a tool for discovery. (shrink)

Abstract Recent criticisms of intuition from experimental philosophy and elsewhere have helped undermine the authority of traditional conceptual analysis. As the product of more empirically informed philosophical methodology, this result is compelling and philosophically salutary. But the negative critiques rarely suggest a positive alternative. In particular, a normative account of concept determination—how concepts should be characterized—is strikingly absent from such work. Carnap's underappreciated theory of explication provides such a theory. Analyses of complex concepts in empirical sciences illustrates and supports this (...) claim, and counteracts the charge explication is only suitable for highly mathematical, axiomatic contexts. Explication is also defended against the influential criticism it is “philosophically unilluminating”. Content Type Journal Article Category Original paper in Philosophy of Science Pages 1-19 DOI 10.1007/s13194-011-0027-5 Authors James Justus, Philosophy Department, Florida State University and University of Sydney, Tallahassee, FL 32306, USA Journal European Journal for Philosophy of Science Online ISSN 1879-4920 Print ISSN 1879-4912. (shrink)

The work of mathematician and logician Alfred Tarski (1901--1983) marks the transition from substantial to deflationary views about truth.

It is generally agreed that the method of explication consists in replacing a vague, presystematic notion (the explicandum) with a precise notion (the explicatum) formulated in a systematic context. However, Carnap and others who have used this and related terms appear to hold inconsistent views as to what constitutes an adequate explication. The central feature of the present explication of 'explication' is the correspondence condition: permitting the explicandum to deviate from some established "ordinary-language" conventions but, at the same time, requiring (...) that the explicatum correspond (via an effective translation) to the chosen "definitive intension" of the explicandum. (In effect, the first stages of an explication provide an informal characterization of a vague and possibly inconsistent language convention.) The present account of explication contrasts sharply with that sketched by Quine in Word and Object (although Quine accepts a correspondence condition of a sort). The terms `explication 1 ' and `explication 2 ' are used to indicate these quite different senses of the term. In Kaplan's terminology, explication 1 is intended to remedy "external vagueness" while explication 2 is intended to remedy "internal vagueness.". (shrink)

Of course we all know now that mathematics has proved that logic doesn't really make sense, but Etchemendy (philosophy, Stanford Univ.) goes further and challenges the received view of the conceptual underpinnings of modern logic by arguing that Tarski's model-theoretic analysis of logical consequences is wrong. He may have found the soft underbelly of the dead horse. Annotation copyrighted by Book News, Inc., Portland, OR.

Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church's (...) Thesis, as Gödel and others suggested may be possible. In a similar way, but with a different set of basic operations, one can prove Turing's Thesis, characterizing the effective string functions, and--in particular--the effectively-computable functions on string representations of numbers. (shrink)

Recent years have witnessed a revival of interest in the method of explication as a procedure for conceptual engineering in philosophy and in science. In the philosophical literature, there has been a lively debate about the different desiderata that a good explicatum has to satisfy. In comparison, the goal of explicating the concept of explication itself has not been central to the philosophical debate. The main aim of this work is to suggest a way of filling this gap by explicating (...) ‘explication’ by means of conceptual spaces theory. Specifically, I show how different, strictly-conceptual readings of explication desiderata can be made precise as geometrical or topological constraints over the conceptual spaces related to the explicandum and the explicatum. Moreover, I show also how the richness of the geometrical representation of concepts in conceptual spaces theory allows us to achieve more fine-grained readings of explication desiderata, thereby overcoming some alleged limitations of explication as a procedure of conceptual engineering. (shrink)

Recent years have witnessed a revival of interest in the method of explication as a procedure for conceptual engineering in philosophy and in science. In the philosophical literature, there has been a lively debate about the different desiderata that a good explicatum has to satisfy. In comparison, the goal of explicating the concept of explication itself has not been central to the philosophical debate. The main aim of this work is to suggest a way of filling this gap by explicating (...) ‘explication’ by means of conceptual spaces theory. Specifically, I show how different, strictly-conceptual readings of explication desiderata can be made precise as geometrical or topological constraints over the conceptual spaces related to the explicandum and the explicatum. Moreover, I show also how the richness of the geometrical representation of concepts in conceptual spaces theory allows us to achieve more fine-grained readings of explication desiderata, thereby overcoming some alleged limitations of explication as a procedure of conceptual engineering. (shrink)

Taking Carnap’s classic exposition as a starting point, this paper develops a pragmatic account of the method of explication, defends it against a range of challenges and proposes a detailed recipe for the practice of explicating. It is then argued that confusions are involved in characterizing explications as definitions, and in advocating precising definitions as an alternative to explications. Explication is better characterized as conceptual re-engineering for theoretical purposes, in contrast to conceptual re-engineering for other purposes and improving exactness for (...) purely practical reasons. Finally, three limitations which call for further development of the method of explication are discussed. (shrink)

Carnap and Goodman developed methods of conceptual re-engineering known respectively as explication and reflective equilibrium. These methods aim at advancing theories by developing concepts that are simultaneously guided by pre-existing concepts and intended to replace these concepts. This paper shows that Carnap’s and Goodman’s methods are historically closely related, analyses their structural interconnections, and argues that there is great systematic potential in interpreting them as aspects of one method, which ultimately must be conceived as a component of theory development. The (...) main results are: an adequate method of conceptual re-engineering must focus not on individual concepts but on systems of concepts and theories; the linear structure of Carnapian explication must be replaced by a process of mutual adjustments as described by Goodman; Carnap’s condition of similarity can be analysed into two components, one securing a relation to the specific extensions of the pre-existing concepts, one regulating the transition to the new system of concepts; these two criteria of adequacy can be built into Goodman’s account of reflective equilibrium to ensure that the resulting concepts promote theoretical virtues while being sufficiently similar to the concepts we started out with. (shrink)

Carnap's ideal of explication has become a key concept in analytic philosophy and the basis of a method of analysis which may be considered as an alternative to various forms of naturalism, including Quine's conception of a naturalized epistemology. More recently, new light has been shed on this aspect of the classical Carnap-Quine debate by contemporary philosophers. Whereas Michael Friedman articulated a notion of relativized a priori which owes much to Carnap's internal/external distinction, André Carus attempted to restate Carnap's ideal (...) of explication in a way that bridges the gap between conceptual engineering and naturalism. On the other hand, Mark Wilson argued that concepts develop in unpredictable ways and cannot be planned in the way classical analytic philosophy has assumed from Frege and Russell onwards. This book consists of a series of defences as well as critiques of Carnap's programme, setting it in its historical context, discussing specific cases of explications, and enriching the on-going debate on conceptual engineering and naturalism in analytic philosophy.Carnap's ideal of explication has become a key concept in analytic philosophy and the basis of a method of analysis which may be considered as an alternative to various forms of naturalism, including Quine's conception of a naturalized epistemology. More recently, new light has been shed on this aspect of the classical Carnap-Quine debate by contemporary philosophers. Whereas Michael Friedman articulated a notion of relativized a priori which owes much to Carnap's internal/external distinction, André Carus attempted to restate Carnap's ideal of explication in a way that bridges the gap between conceptual engineering and naturalism. On the other hand, Mark Wilson argued that concepts develop in unpredictable ways and cannot be planned in the way classical analytic philosophy has assumed from Frege and Russell onwards. This book consists of a series of defences as well as critiques of Carnap's programme, setting it in its historical context, discussing specific cases of explications, and enriching the on-going debate on conceptual engineering and naturalism in analytic philosophy. (shrink)

Rudolf Carnap is widely regarded as one of the most important philosophers of the twentieth century. Born in Germany and later a US citizen, he was a founder of the philosophical movement known as Logical Empiricism. He was strongly influenced by a number of different philosophical traditions, and also by the German Youth Movement, the First World War, and radical socialism. This book places his central ideas in a broad cultural, political and intellectual context, showing how he synthesised many different (...) currents of thought to achieve a philosophical perspective that remains strikingly relevant in the twenty-first century. Its rich account of a philosopher's response to his times will appeal to all who are interested in the development of philosophy in the twentieth century. (shrink)

Wilfried Sieg. Calculations by Man and Machine: Conceptual Analysis.

Wilfried Sieg. Calculations by Man and Machine: Mathematical Presentation.

Wilfred Sieg and John Byrnes. K-Graph Machines: Generalizing Turing's Machines and Arguments.