The central topic of this article is (the possibility of) de re knowledge about natural numbers and its relation with names for numbers. It is held by several prominent philosophers that (Peano) numerals are eligible for existential quantification in epistemic contexts (‘canonical’), whereas other names for natural numbers are not. In other words, (Peano) numerals are intimately linked with de re knowledge about natural numbers, whereas the other names for natural numbers are not. In this article I am looking for (...) an explanation of this phenomenon. It is argued that the standard induction scheme plays a key role. (shrink)

Rosenkranz has recently proposed a logic for propositional, non-factive, all-things-considered justification, which is based on a logic for the notion of being in a position to know, 309–338 2018). Starting from three quite weak assumptions in addition to some of the core principles that are already accepted by Rosenkranz, I prove that, if one has positive introspective and modally robust knowledge of the axioms of minimal arithmetic, then one is in a position to know that a sentence is not provable (...) in minimal arithmetic or that the negation of that sentence is not provable in minimal arithmetic. This serves as the formal background for an example that calls into question the correctness of Rosenkranz’s logic of justification. (shrink)

The subject of this article is Modal-Epistemic Arithmetic (MEA), a theory introduced by Horsten to interpret Epistemic Arithmetic (EA), which in turn was introduced by Shapiro to interpret Heyting Arithmetic. I will show how to interpret MEA in EA such that one can prove that the interpretation of EA is MEA is faithful. Moreover, I will show that one can get rid of a particular Platonist assumption. Then I will discuss models for MEA in light of the problems of logical (...) omniscience and logical competence. Awareness models, impossible worlds models and syntactical models have been introduced to deal with the first problem. Certain conditions on the accessibility relations are needed to deal with the second problem. I go on to argue that those models are subject to the problem of quantifying in, for which I will provide a solution. (shrink)

Famously, the Church–Fitch paradox of knowability is a deductive argument from the thesis that all truths are knowable to the conclusion that all truths are known. In this argument, knowability is analyzed in terms of having the possibility to know. Several philosophers have objected to this analysis, because it turns knowability into a nonfactive notion. In addition, they claim that, if the knowability thesis is reformulated with the help of factive concepts of knowability, then omniscience can be avoided. In this (...) article we will look closer at two proposals along these lines :557–568, 1985; Fuhrmann in Synthese 191:1627–1648, 2014a), because there are formal models available for each. It will be argued that, even though the problem of omniscience can be averted, the problem of possible or potential omniscience cannot: there is an accessible state at which all truths are known. Furthermore, it will be argued that possible or potential omniscience is a price that is too high to pay. Others who have proposed to solve the paradox with the help of a factive concept of knowability should take note :53–73, 2010; Spencer in Mind 126:466–497, 2017). (shrink)

The topic of this article is the closure of a priori knowability under a priori knowable material implication: if a material conditional is a priori knowable and if the antecedent is a priori knowable, then the consequent is a priori knowable as well. This principle is arguably correct under certain conditions, but there is at least one counterexample when completely unrestricted. To deal with this, Anderson proposes to restrict the closure principle to necessary truths and Horsten suggests to restrict it (...) to formulas that belong to less expressive languages. In this article it is argued that Horsten’s restriction strategy fails, because one can deduce that knowable ignorance entails necessary ignorance from the closure principle and some modest background assumptions, even if the expressive resources do not go beyond those needed to formulate the closure principle itself. It is also argued that it is hard to find a justification for Anderson’s restricted closure principle, because one cannot deduce it even if one assumes very strong modal and epistemic background principles. In addition, there is an independently plausible alternative closure principle that avoids all the problems without the need for restriction. (shrink)

The primary purpose of this note is to demonstrate that predicative Frege arithmetic naturally interprets certain weak but non-trivial arithmetical theories. It will take almost as long to explain what this means and why it matters as it will to prove the results.

Dan Dennett and Jerry Fodor have recently offered diametrically opposed estimations of the relevance of the theory of natural selection to an adequate theory of intentionality. In this paper, I show, first, how this opposition can be traced largely to differences both in their respective understandings of what the theory of natural selection includes, and in their respective ‘pre-theoretic’ takes on the datum to be explained by a theory of intentionality. These differences, in turn, have been ‘pre-selected’ by contrasting outlooks (...) on the general nature of the explanatory enterprise. While no final adjudication of these large issues is attempted, I argue, second, that it is important to distinguish two rather different questions about the relevance of natural selection to the nature of intentionality, and that, having done so, one can see that, from standpoints purely internal to their respective projects, Dennett and Fodor each in his own way misconstrues the relevance of natural selection. (shrink)

The fact that Gödel's famous incompleteness theorem and the archetype of all logical paradoxes, that of the Liar, are related closely is, of course, not only well known, but is a part of the common knowledge of the community of logicians. Indeed, almost every more or less formal treatment of the theorem makes a reference to this connection. Gödel himself remarked in the paper announcing his celebrated result :The analogy between this result and Richard's antinomy leaps to the eye;there is (...) also a close relationship with the ‘liar’ antinomy, since … we are… confronted with a proposition which asserts its own unprovability.In the light of the fact that the existence of this connection is commonplace it is all the more surprising that very little can be learnt about its exact nature except perhaps that it is some kind of similarity or analogy. There is, however, a lot more to it than that. Indeed, as we shall try to show below, the general ideas underlying the three central theorems concerning internal limitations of formal deductive systems can be taken as different ways to resolve the Liar paradox. More precisely, it will turn out that an abstract formal variant of the Liar paradox, which can almost straightforwardly inferred from its original ordinary language version, is a possible common generalization of Gödel's incompleteness theorem, the theorem of Tarski on the undefinability of truth, and that of Church concerning the undecidability of provability. (shrink)

The vision of machines autonomously carrying out substantive conjecture generation, theorem discovery, proof discovery, and proof verification in mathematics and the natural sciences has a long history that reaches back before the development of automatic systems designed for such processes. While there has been considerable progress in proof verification in the formal sciences, for instance the Mizar project’ and the four-color theorem, now machine verified, there has been scant such work carried out in the realm of the natural sciences—until recently. (...) The delay in the case of the natural sciences can be attributed to both a lack of formal analysis of the so-called “theories” in such sciences, and the lack of sufficient progress in automated theorem proving. While the lack of analysis is probably due to an inclination toward informality and empiricism on the part of nearly all of the relevant scientists, the lack of progress is to be expected, given the computational hardness of automated theorem proving; after all, theoremhood in even first-order logic is Turing-undecidable. We give in the present short paper a compressed report on our building upon these formal theories using logic-based AI in order to achieve, in relativity, both machine proof discovery and proof verification, for theorems previously established by humans. Our report is intended to serve as a springboard to machine-produced results in the future that have not been obtained by humans. (shrink)

Everything you always wanted to know about structural realism but were afraid to ask Content Type Journal Article Pages 227-276 DOI 10.1007/s13194-011-0025-7 Authors Roman Frigg, Department of Philosophy, Logic and Scientific Method, London School of Economics and Political Science, Houghton Street, London, WC2A 2AE UK Ioannis Votsis, Philosophisches Institut, Heinrich-Heine-Universität Düsseldorf, Universitätsstraße 1, Geb. 23.21/04.86, 40225 Düsseldorf, Germany Journal European Journal for Philosophy of Science Online ISSN 1879-4920 Print ISSN 1879-4912 Journal Volume Volume 1 Journal Issue Volume 1, Number 2.

Charles L. Dodgson's reputation as a significant figure in nineteenth-century logic was firmly established when the philosopher and historian of philosophy William Warren Bartley, III published Dodgson's ?lost? book of logic, Part II of Symbolic Logic, in 1977. Bartley's commentary and annotations confirm that Dodgson was a superb technical innovator. In this paper, I closely examine Dodgson's methods and their evolution in the two parts of Symbolic Logic to clarify and justify Bartley's claims. Then, using more recent publications and unpublished (...) letters, I argue that Dodgson approached the elimination problem in class logic differently than his contemporaries, and in doing so, anticipated several important concepts and techniques in automated deductive reasoning. These materials also provide additional insight into his reasons for writing this book. (shrink)

This paper concerns the relationship between transitivity of entailment, omega-inconsistency and nonstandard models of arithmetic. First, it provides a cut-free sequent calculus for non-transitive logic of truth STT based on Robinson Arithmetic and shows that this logic is omega-inconsistent. It then identifies the conditions in McGee for an omega-inconsistent logic as quantified standard deontic logic, presents a cut-free labelled sequent calculus for quantified standard deontic logic based on Robinson Arithmetic where the deontic modality is treated as a predicate, proves omega-inconsistency (...) and shows thus, pace Cobreros et al., that the result in McGee does not rely on transitivity. Finally, it also explains why the omega-inconsistent logics of truth in question do not require nonstandard models of arithmetic. (shrink)

This paper develops the very basic notions of analysis in a weak second-order theory of arithmetic BTFA whose provably total functions are the polynomial time computable functions. We formalize within BTFA the real number system and the notion of a continuous real function of a real variable. The theory BTFA is able to prove the intermediate value theorem, wherefore it follows that the system of real numbers is a real closed ordered field. In the last section of the paper, we (...) show how to interpret the theory BTFA in Robinson's theory of arithmetic Q. This fact entails that the elementary theory of the real closed ordered fields is interpretable in Q. (shrink)

I defend an account of God’s ineffability that depends on the distinction between fundamental and non-fundamental truths. I argue that although there are fundamentally true propositions about God, no creature can have them as the object of a propositional attitude, and no sentence can perfectly carve out their structures. Why? Because these propositions have non-enumerable structures. In principle, no creature can fully grasp God’s intrinsic nature, nor can they develop a language that fully describes it. On this account, the ineffability (...) of God is explained in terms of the inability of our language and mental capacities to grasp God as he really is. I will motivate my account by distinguishing it from a rival proposal. According to this rival, there are no fundamentally true propositions about God’s intrinsic nature. I argue that this rival proposal faces problems that my account does not face. And unlike this rival and other accounts of ineffability, my account provides a fitting explanation of why God is ineffable. God is ineffable because the structure of his intrinsic nature is infinite. (shrink)

By a well-known result of Kotlarski et al., first-order Peano arithmetic \ can be conservatively extended to the theory \ of a truth predicate satisfying compositional axioms, i.e., axioms stating that the truth predicate is correct on atomic formulae and commutes with all the propositional connectives and quantifiers. This result motivates the general question of determining natural axioms concerning the truth predicate that can be added to \ while maintaining conservativity over \. Our main result shows that conservativity fails even (...) for the extension of \ obtained by the seemingly weak axiom of disjunctive correctness \ that asserts that the truth predicate commutes with disjunctions of arbitrary finite size. In particular, \ implies \\). Our main result states that the theory \ coincides with the theory \ obtained by adding \-induction in the language with the truth predicate. This result strengthens earlier work by Kotlarski and Cieśliński. For our proof we develop a new general form of Visser’s theorem on non-existence of infinite descending chains of truth definitions and prove it by reduction to Gödel’s second incompleteness theorem, rather than by using the Visser–Yablo paradox, as in Visser’s original proof. (shrink)

At some step in proving the Liar Paradox in natural language, a sentence is derived that seems overdetermined with respect to its semantic value. This is complemented by Tarski’s Theorem that a formal language cannot consistently contain a naive truth predicate given the laws of logic used in proving the Liar paradox. I argue that proofs of the Eubulidean Liar either use a principle of truth with non-canonical names in a fallacious way or make a fallacious use of substitution of (...) identicals. Tarski never committed the first fallacy and may have himself considered it fallacious. Nevertheless, I clarify that it is fallacious. I then argue substitution of identicals needs to be restricted within the scope of the truth predicate. A logic for truth implementing this restriction is a monotonic extension of a classical first order logic, or indeed a formalizable fragment of natural language. Proofs of Tarski’s Indefinability of Truth theorem are invalid in this logic. This approach generalizes to invalidate proofs of Liar-like paradoxes, particularly the predicate form of the Knower paradox. Consequently, such a logic can be further extended in a way that avoids Montague’s theorem for such a system. Yet, the semantic status of a Liar sentence is not fully resolved. It is no longer overdetermined; it is now underdetermined. (shrink)

The paper is concerned with Quine's substitutional account of logical truth. The critique of Quine's definition tends to focus on miscellaneous odds and ends, such as problems with identity. However, in an appendix to his influential article On Second Order Logic, George Boolos offered an ingenious argument that seems to diminish Quine's account of logical truth on a deeper level. In the article he shows that Quine's substitutional account of logical truth cannot be generalized properly to the general concept of (...) logical consequence. The purpose of this paper is threefold: first, to introduce the reader to the metamathematics of Quine's substitutional definition of logical truth; second, to make Boolos' result accessible to a broader audience by giving a detailed and self-contained presentation of his proof; and, finally, to discuss some of the possible implications and how a defender of the Quinean concepts might react to the challenge posed by Boolos' result. (shrink)

Computationalism holds that our grasp of notions like ‘computable function’ can be used to account for our putative ability to refer to the standard model of arithmetic. Tennenbaum's Theorem has been repeatedly invoked in service of this claim. I will argue that not only do the relevant class of arguments fail, but that the result itself is most naturally understood as having the opposite of a reference-fixing effect — i.e., rather than securing the determinacy of number-theoretic reference, Tennenbaum's Theorem points (...) towards a sense in which portions of our computational vocabulary should be regarded as model-relative. (shrink)

This paper discusses the history of the confusion and controversies over whether the definition of consequence presented in the 11-page 1936 Tarski consequence-definition paper is based on a monistic fixed-universe framework?like Begriffsschrift and Principia Mathematica. Monistic fixed-universe frameworks, common in pre-WWII logic, keep the range of the individual variables fixed as the class of all individuals. The contrary alternative is that the definition is predicated on a pluralistic multiple-universe framework?like the 1931 Gödel incompleteness paper. A pluralistic multiple-universe framework recognizes multiple (...) universes of discourse serving as different ranges of the individual variables in different interpretations?as in post-WWII model theory. In the early 1960s, many logicians?mistakenly, as we show?held the ?contrary alternative? that Tarski 1936 had already adopted a Gödel-type, pluralistic, multiple-universe framework. We explain that Tarski had not yet shifted out of the monistic, Frege?Russell, fixed-universe paradigm. We further argue that between his Principia-influenced pre-WWII Warsaw period and his model-theoretic post-WWII Berkeley period, Tarski's philosophy underwent many other radical changes. (shrink)

Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term (...) “accelerating Turing machine” is used to refer to two very different species of accelerating machine, which we call end-stage-in and end-stage-out machines, respectively. We argue that end-stage-in accelerating machines are not Turing machines at all. We then present two differing conceptions of computation, the internal and the external, and introduce the notion of an epistemic embedding of a computation. We argue that no accelerating Turing machine computes the halting function in the internal sense. Finally, we distinguish between two very different conceptions of the Turing machine, the purist conception and the realist conception; and we argue that Turing himself was no subscriber to the purist conception. We conclude that under the realist conception, but not under the purist conception, an accelerating Turing machine is able to compute the halting function in the external sense. We adopt a relatively informal approach throughout, since we take the key issues to be philosophical rather than mathematical. (shrink)

Christopher G. Timpson provides the first full-length philosophical treatment of quantum information theory and the questions it raises for our understanding of the quantum world. He argues for an ontologically deflationary account of the nature of quantum information, which is grounded in a revisionary analysis of the concepts of information.

p. cm. — (Zeuthen lecture book series) Includes bibliographical references (p. ) and index. ISBN 0-262-18187-8 (hardcover : alk. paper). — ISBN 0-262-68100-5 (pbk. : alk. paper) 1. Decision-making. 2. Economic man. 3. Game theory. 4. Rational expectations (Economic theory) I. Title. II. Series.

We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. -/- We then adopt what may (...) be labelled a finitary, evidence-based, `agnostic' perspective and argue that Brouwerian atheism is merely a restricted perspective within the finitary agnostic perspective, whilst Hilbertian theism contradicts the finitary agnostic perspective. -/- We then consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary, evidence-based, definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways. -/- We show that the two definitions correspond to two distinctly different---not necessarily evidence-based but complementary---assignments of satisfaction and truth to the compound formulas of PA over N. -/- We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both the complementary interpretations; and conclude some unsuspected constructive consequences of such complementarity for the foundations of mathematics, logic, philosophy, and the physical sciences. -/- . (shrink)

Complex human reasoning involves minimal abilities to extract conclusions implied in the available information. These abilities are considered “deductive” because they exemplify certain abstract relations among propositions or probabilities called deductive arguments. However, the electrophysiological dynamics which supports such complex cognitive pro- cesses has not been addressed yet. In this work we consider typically deductive logico- probabilistically valid inferences and aim to verify or refute their electrophysiological functional connectivity differences from invalid inferences with the same content (same relational variables, same (...) stimuli, same relevant and salient features). We recorded the brain electrophysiological activity of 20 participants (age 1⁄4 20.35 ± 3.23) by means of an MEG system during two consecutive reasoning tasks: a search task (invalid condition) without any specific deductive rules to follow, and a logically valid deductive task (valid condition) with explicit deductive rules as instructions. We calculated the functional connectivity (FC) for each condition and conducted a seed-based analysis in a set of cortical regions of interest. Finally, we used a cluster-based permutation test to compare the dif- ferences between logically valid and invalid conditions in terms of FC. As a first novel result we found higher FC for valid condition in beta band between regions of interest and left prefrontal, temporal, parietal, and cingulate structures. FC analysis allows a second novel result which is the definition of a propositional network with operculo-cingular, parietal and medial nodes, specifically including disputed medial deductive “core” areas. The experiment discloses measurable cortical processes which do not depend on content but on truth-functional propositional operators. These experimental novelties may contribute to understand the cortical bases of deductive processes. (shrink)

Alonzo Church (1903–1995) was a renowned mathematical logician, philosophical logician, philosopher, teacher and editor. He was one of the founders of the discipline of mathematical logic as it developed after Cantor, Frege and Russell. He was also one of the principal founders of the Association for Symbolic Logic and the Journal of Symbolic Logic. The list of his students, mathematical and philosophical, is striking as it contains the names of renowned logicians and philosophers. In this article, we focus primarily on (...) Church’s philosophical contributions. (For an account of his life and academic history see the Introduction to The Collected Works of Alonzo Church (2019).) However, we also discuss his mathematical results when it is desirable to do so in order to pursue a philosophical issue. (shrink)

This dissertation makes two primary contributions. The first three chapters develop an interpretation of Carnap's Meta-Philosophical Program which places stress upon his methodological analysis of the sciences over and above the Principle of Tolerance. Most importantly, I suggest, is that Carnap sees philosophy as contiguous with science—as a part of the scientific enterprise—so utilizing the very same methods and subject to the same limitations. I argue that the methodological reforms he suggests for philosophy amount to philosophy as the explication of (...) the concepts of science through the construction and use of suitably robust meta-logical languages. My primary interpretive claim is that Carnap's understanding of logic and mathematics as a set of formal auxiliaries is premised upon this prior analysis of the character of logico-mathematical knowledge, his understanding of its role in the language of science, and the methods used by practicing mathematicians. Thus the Principle of Tolerance, and so Carnap's logical pluralism, is licensed and justified by these methodological insights. This interpretation of Carnap's program contrasts with the popular Deflationary reading as proposed in Goldfarb & Ricketts. The leading idea they attribute to Carnap is a Logocentrism: That philosophical assertions are always made relative to some particular language, and that our choice of syntactical rules for a language are constitutive of its inferential structure and methods of possible justification. Consequently Tolerance is considered the foundation of Carnap's entire program. My third chapter argues that this reading makes Carnap's program philosophically inert, and I present significant evidence that such a reading is misguided. The final chapter attempts to extend the methodological ideals of Carnap's program to the analysis of the ongoing debate between category- and set-theoretic foundations for mathematics. Recent criticism of category theory as a foundation charges that it is neither autonomous from set theory, nor offers a suitable ontological grounding for mathematics. I argue that an analysis of concepts can be foundationally informative without requiring the construction of those concepts from first principles, and that ontological worries can be seen as methodologically unfruitful. (shrink)

A myth has arisen concerning Turing's paper of 1936, namely that Turing set forth a fundamental principle concerning the limits of what can be computed by machine - a myth that has passed into cognitive science and the philosophy of mind, to wide and pernicious effect. This supposed principle, sometimes incorrectly termed the 'Church-Turing thesis', is the claim that the class of functions that can be computed by machines is identical to the class of functions that can be computed by (...) Turing machines. In point of fact Turing himself nowhere endorses, nor even states, this claim (nor does Church). I describe a number of notional machines, both analogue and digital, that can compute more than a universal Turing machine. These machines are exemplars of the class of _nonclassical_ computing machines. Nothing known at present rules out the possibility that machines in this class will one day be built, nor that the brain itself is such a machine. These theoretical considerations undercut a number of foundational arguments that are commonly rehearsed in cognitive science, and gesture towards a new class of cognitive models. (shrink)

Concrete Causation centers about theories of causation, their interpretation, and their embedding in metaphysical-ontological questions, as well as the application of such theories in the context of science and decision theory. The dissertation is divided into four chapters, that firstly undertake the historical-systematic localization of central problems (chapter 1) to then give a rendition of the concepts and the formalisms underlying David Lewis' and Judea Pearl's theories (chapter 2). After philosophically motivated conceptual deliberations Pearl's mathematical-technical framework is drawn on for (...) an epistemic interpretation and for emphasizing the knowledge-organizing aspect of causality in an extension of the interventionist Bayes net account of causation (chapter 3). Integrating causal and non-causal knowledge in unified structures ultimately leads to an approach towards solving problems of (causal) decision theory and at the same time facilitates the representation of logical-mathematical, synonymical, as well as reductive relationships in efficiently structured, operational nets of belief propagation (chapter 4). (shrink)

This paper is concerned with counterfactual logic and its implications for the modal status of mathematical claims. It is most directly a response to an ambitious program by Yli-Vakkuri and Hawthorne (2018), who seek to establish that mathematics is committed to its own necessity. I claim that their argument fails to establish this result for two reasons. First, their assumptions force our hand on a controversial debate within counterfactual logic. In particular, they license counterfactual strengthening— the inference from ‘If A (...) were true then C would be true’ to ‘If A and B were true then C would be true’—which many reject. Second, the system they develop is provably equivalent to appending Deduction Theorem to a T modal logic. It is unsurprising that the combination of Deduction Theorem with T results in necessitation; indeed, it is precisely for this reason that many logicians reject Deduction Theorem in modal contexts. If Deduction Theorem is unacceptable for modal logic, it cannot be assumed to derive the necessity of mathematics. (shrink)

The goal of inquiry in this essay is to ascertain to what extent the Principle of Compositionality – the thesis that the meaning of a complex expression is determined by the meaning of its parts and its mode of composition – can be justifiably imposed as a constraint on semantic theories, and thereby provide information about what meanings are. Apart from the introduction and the concluding chapter the thesis is divided into five chapters addressing different questions pertaining to the overarching (...) goal of inquiry. Chapter Two is an attempt to determine whether the Principle of Compositionality is a trivial principle. It is argued that this is not the case in the context of providing the semantics of natural languages since it is an open question whether the best theories that respect available syntactic and semantic data are compositional. Chapter Three and Chapter Four ask whether there are reasons to think that the Principle of Compositionality is true. It is argued that the three most commonly cited reasons for thinking that correct semantic theories must be compositional – Linguistic Creativity, Productivity and Systematicity – in fact only give us reasons to think that the meaning of complex expressions depend on the meanings of their parts and their modes of composition, but not that the meaning of complex expressions depend ONLY on those factors. Chapter Five asks whether there are any reasons to think that the Principle of Compositionality is false. It is argued that all the phenomena that have been suggested entail non-compositionality are in fact compatible with some versions of compositionality. Even if this conclusion is reached in this chapter, the conclusion of the previous two chapters entails that we are not justified in imposing the Principle of Compositionality as an adequacy constraint on Semantic theories. Chapter Six explores the ways in which information about what meanings are can be derived by imposing constraints on semantic theories. It is argued that the distinction emphasized in Chapter Three and Chapter Four between depending on and depending ONLY on is of critical importance. It is demonstrated that the informative potential of the Principle of Compositionality goes far beyond that of the principle we are in fact justified in imposing on semantic theories. So not only is it the case that we cannot learn anything about meanings from the justified imposition of the Principle of Compositionality – since we cannot justifiably impose it as a constraint on semantic theories – what we could have learned from it had we been justified in imposing it is very different from what we can learn from the principle that we are justified in imposing. (shrink)

The goal of creating Artificial General Intelligence (AGI) – or in other words of creating Turing machines (modern computers) that can behave in a way that mimics human intelligence – has occupied AI researchers ever since the idea of AI was first proposed. One common theme in these discussions is the thesis that the ability of a machine to conduct convincing dialogues with human beings can serve as at least a sufficient criterion of AGI. We argue that this very ability (...) should be accepted also as a necessary condition of AGI, and we provide a description of the nature of human dialogue in particular and of human language in general against this background. We then argue that it is for mathematical reasons impossible to program a machine in such a way that it could master human dialogue behaviour in its full generality. This is (1) because there are no traditional explicitly designed mathematical models that could be used as a starting point for creating such programs; and (2) because even the sorts of automated models generated by using machine learning, which have been used successfully in areas such as machine translation, cannot be extended to cope with human dialogue. If this is so, then we can conclude that a Turing machine also cannot possess AGI, because it fails to fulfil a necessary condition thereof. At the same time, however, we acknowledge the potential of Turing machines to master dialogue behaviour in highly restricted contexts, where what is called “narrow” AI can still be of considerable utility. (shrink)

The paper presents an argument against a "metaphysical'* conception of logic according to which logic spells out a specific kind of mathematical structure that is somehow inherently related to our factual reasoning. In contrast, it is argued that it is always an empirical question as to whether a given mathematical structure really does captures a principle of reasoning. lMore generally, it is argued that it is not meaningful to replace an empirical investigation of a thing by an investigation of its (...) a priori analyzable structure without paying due attention to the question of whether it really is the structure of the thing in question.) It is proposed to elucidate the situation by distinguishing two essentially different realms with which our reason must deal: "the realm of the natural'*, constituted by the things of our empirical world, and "the realm of the formal'*, constituted by the structures that we use as "prisms'* to view, to make sense of, and to reconstruct the world. It is suggested that this vantage point may throw light on many foundational problems of logic. (shrink)

The five English words—sentence, proposition, judgment, statement, and fact—are central to coherent discussion in logic. However, each is ambiguous in that logicians use each with multiple normal meanings. Several of their meanings are vague in the sense of admitting borderline cases. In the course of displaying and describing the phenomena discussed using these words, this paper juxtaposes, distinguishes, and analyzes several senses of these and related words, focusing on a constellation of recommended senses. One of the purposes of this paper (...) is to demonstrate that ordinary English properly used has the resources for intricate and philosophically sound investigation of rather deep issues in logic and philosophy of language. No mathematical, logical, or linguistic symbols are used. Meanings need to be identified and clarified before being expressed in symbols. We hope to establish that clarity is served by deferring the extensive use of formalized or logically perfect languages until a solid “informal” foundation has been established. Questions of “ontological status”—e.g., whether propositions or sentences, or for that matter characters, numbers, truth-values, or instants, are “real entities”, are “idealizations”, or are “theoretical constructs”—plays no role in this paper. As is suggested by the title, this paper is written to be read aloud. -/- I hope that reading this aloud in groups will unite people in the enjoyment of the humanistic spirit of analytic philosophy. (shrink)

Scientific models are important, if not the sole, units of science. This thesis addresses the following question: in virtue of what do scientific models represent their target systems? In Part i I motivate the question, and lay out some important desiderata that any successful answer must meet. This provides a novel conceptual framework in which to think about the question of scientific representation. I then argue against Callender and Cohen’s attempt to diffuse the question. In Part ii I investigate the (...) ideas that scientific models are ‘similar’, or structurally morphic, to their target systems. I argue that these approaches are misguided, and that at best these relationships concern the accuracy of a pre-existing representational relationship. I also pay particular attention to the sense in which target systems can be appropriately taken to exhibit a ‘structure’, and van Fraassen’s recent argument concerning the pragmatic equivalence between representing phenomena and data. My next target is the idea that models should not be seen as objects in their own right, but rather what look like descriptions of them are actually direct descriptions of target systems, albeit not ones that should be understood literally. I argue that these approaches fail to do justice to the practice of scientific modelling. Finally I turn to the idea that how models represent is grounded, in some sense, in their inferential capacity. I compare this approach to anti-representationalism in the philosophy of language and argue that analogous issues arise in the context of scientific representation. Part iii contains my positive proposal. I provide an account of scientific representation based on Goodman and Elgin’s notion of representation-as. The result is a highly conventional account which is the appropriate level of generality to capture all of its instances, whilst remaining informative about the notion. I illustrate it with reference to the Phillips-Newlyn machine, models of proteins, and the Lotka-Volterra model of predator-prey systems. These examples demonstrate how the account must be understood, and how it sheds light on our understanding of how models are used. I finally demonstrate how the account meets the desiderata laid out at the beginning of the thesis, and outline its implications for further questions from the philosophy of science; not limited to issues surrounding the applicability of mathematics, idealisation, and what it takes for a model to be ‘true’. (shrink)

Biochemists often adopt what may be called the “Strategy of Decomposition” for the causal discovery of biochemical pathway dynamic behaviours. This involves decomposing a pathway into a set of isolated parts, which are then analysed separately. It is assumed that knowledge gained of the isolated parts can then be used to explain the dynamic behaviours of the whole pathway. My thesis addresses the extent to which use of the Strategy of Decomposition is warranted. I evaluate two challenges contained in Bechtel (...) and Richardson’s Discovering Complexity. The first challenge is that pathways lack the ‘modular’ structure assumed in the Strategy of Decomposition. Bechtel and Richardson take biochemists to use a concept of modularity called ‘near decomposability’. The second challenge is that pathways have ‘Pathway Emergent’ behaviours. I reject both challenges. I show that near decomposability is the wrong type of modularity to apply to pathways, and that the occurrence of Pathway Emergence has not been established. I argue that an underlying problem with Bechtel and Richardson’s analyses is that they overstate the consequences of feedback and nonlinearity for the Strategy of Decomposition. Instead, the analysis of pathway modularity and emergence needs to be centered on the context-sensitivity of pathways’ ‘local causal laws’. I identify that the type of modularity assumed in the Strategy of Decomposition is ‘causal law modularity’, which requires the invariance of local causal laws. I also identify a necessary condition for Pathway Emergence: a pathway must manifest at least one local causal law that is not manifested by its isolated parts. I argue that the use of the Strategy of Decomposition may often be unwarranted. This is because the local causal laws of pathways are highly context-sensitive, and pathways might often not be causal law modular. This context-sensitivity also leaves open the possibility of Pathway Emergence. (shrink)

In his recent _The Rediscovery of the Mind_ John Searle tries to destroy cognitive science _and_ preserve a future in which a ``perfect science of the brain'' (1992, p. 235) arrives. I show that Searle can't accomplish both objectives. The ammunition he uses to realise the first stirs up a maelstrom of consciousness so wild it precludes securing the second.

One of Tarski’s stated aims was to give an explication of the classical conception of truth—truth as ‘saying it how it is’. Many subsequent commentators have felt that he achieved this aim. Tarski’s core idea of defining truth via satisfaction has now found its way into standard logic textbooks. This paper looks at such textbook definitions of truth in a model for standard first-order languages and argues that they fail from the point of view of explication of the classical notion (...) of truth. The paper furthermore argues that a subtly different definition—also to be found in classic textbooks but much less prevalent than the kind of definition that proceeds via satisfaction—succeeds from this point of view. (shrink)

This article is about the ontological dispute between finitists, who claim that only finitely many numbers exist, and infinitists, who claim that infinitely many numbers exist. Van Bendegem set out to solve the 'general problem' for finitism: how can one recast finite fragments of classical mathematics in finitist terms? To solve this problem Van Bendegem comes up with a new brand of finitism, namely so-called 'apophatic finitism'. In this article it will be argued that apophatic finitism is unable to represent (...) the negative ontological commitments of infinitism or, in other words, that which does not exist according to infinitism. However, there is a brand of infinitism, so-called 'apophatic infinitism', that is able to represent both the positive and the negative ontological commitments of apophatic finitism. Unfortunately, apophatic finitism cannot adopt that way without losing the ability to represent the positive ontological commitments of infinitism. (shrink)

The ubiquitous assertion that the early calculus of Newton and Leibniz was an inconsistent theory is examined. Two different objects of a possible inconsistency claim are distinguished: (i) the calculus as an algorithm; (ii) proposed explanations of the moves made within the algorithm. In the first case the calculus can be interpreted as a theory in something like the logician’s sense, whereas in the second case it acts more like a scientific theory. I find no inconsistency in the first case, (...) and an inconsistency in the second case which can only be imputed to a small minority of the relevant community. (shrink)