After a short preface, the first of the three sections of this paper is devoted to historical and philosophic aspects of categoricity. The second section is a self-contained exposition, including detailed definitions, of a proof that every mathematical system whose domain is the closure of its set of distinguished individuals under its distinguished functions is categorically characterized by its induction principle together with its true atoms (atomic sentences and negations of atomic sentences). The third section deals with applications especially those (...) involving the distinction between characterizing a system and axiomatizing the truths of a system. (shrink)

According to a view going back to Plato, the aim of philosophy is to acquire knowledge and there is a method to acquire knowledge, namely a method of discovery. In the last century, however, this view has been completely abandoned, the attempt to give a rational account of discovery has been given up, and logic has been disconnected from discovery. This paper outlines a way of reconnecting logic with discovery.

According to a view going back to Plato, the aim of philosophy is to acquire knowledge and there is a method to acquire knowledge, namely a method of discovery. In the last century, however, this view has been completely abandoned, the attempt to give a rational account of discovery has been given up, and logic has been disconnected from discovery. This paper outlines a way of reconnecting logic with discovery.

Although much technical and philosophical attention has been given to relevance logics, the notion of relevance itself is generally left at an intuitive level. It is difficult to find in the literature an explicit account of relevance in formal reasoning. In this article I offer a formal explication of the notion of relevance in deductive logic and argue that this notion has an interesting place in the study of classical logic. The main idea is that a premise is relevant to (...) an argument when it contributes to the validity of that argument. I then argue that the sequents which best embody this ideal of relevance are the so-called perfect sequents—that is, sequents which are valid but have no proper subsequents that are valid. Church’s theorem entails that there is no recursively axiomatizable proof-system that proves all and only the perfect sequents, so the project that emerges from studying perfection in classical logic is not one of finding a perfect subsystem of classical logic, but is rather a comparative study of classifying subsystems of classical logic according to how well they approximate the ideal of perfection. (shrink)

We present a possible computational content of the negative translation of classical analysis with the Axiom of (countable) Choice. Interestingly, this interpretation uses a refinement of the realizability semantics of the absurdity proposition, which is not interpreted as the empty type here. We also show how to compute witnesses from proofs in classical analysis of ∃-statements and how to extract algorithms from proofs of ∀∃-statements. Our interpretation seems computationally more direct than the one based on Godel's Dialectica interpretation.

We prove, among other things, that the number mentioned above cannot be shown to exist without using some $\Pi_1(\mathscr{P})$ instance of the axiom of replacement.

Fregean thoughts (i.e. the senses of assertoric sentences) are structured entities because they are composed of simpler senses that are somehow ordered and interconnected. The constituent senses form a unity because some of them are ?saturated? and some ?unsaturated?. This paper shows that Frege's explanation of the structure of thoughts, which is based on the ?saturated/unsaturated? distinction, is by no means sufficient because it permits what I call ?wild analyses?, which have certain unwelcome consequences. Wild analyses are made possible because (...) any ?unsaturated? sense that is a mode of presentation of a concept together with any ?saturated? sense forms a thought. The reason is that any concept can be applied to any object (which is presented by a ?saturated? sense). This stems from the fact that Frege was willing to admit only total functions. It is also briefly suggested what should be done to block wild analyses. (shrink)

A Dedekind algebra is an ordered pair (B, h), where B is a non-empty set and h is a similarity transformation on B. Among the Dedekind algebras is the sequence of the positive integers. From a contemporary perspective, Dedekind established that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. The purpose here is to show that this seemingly isolated result is a consequence of more general results in the model theory of second-order languages. (...) Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called the configurations of the algebra. There are ?0 isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on ? called its configuration signature. The configuration signature counts the number of configurations in each isomorphism type that occurs in the decomposition of the algebra. Two Dedekind algebras are isomorphic iff their configuration signatures are identical. The second-order theory of any countably infinite Dedekind algebra is categorical, and there are countably infinite Dedekind algebras whose second-order theories are not finitely axiomatizable. It is shown that there is a condition on configuration signatures necessary and sufficient for the second-order theory of a Dedekind algebra to be finitely axiomatizable. It follows that the second-order theory of the sequence of the positive integers is categorical and finitely axiomatizable. (shrink)

In his recent article, titled ‘Royaumont Revisited’, Overgaard challenges Dummett's view that one needs to go as far back as the late nineteenth century in order to discover examples of genuine dialogue between ‘analytic’ and ‘continental’ philosophy. Instead, Overgaard argues that in the 1958 Royaumont colloquium, generally judged as a failed attempt at communication between the two camps, one can find some elements which may be utilized towards re-establishing a dialogue between these two sides. Yet, emphasising this image of Royaumont (...) as a kind of battleground between ‘analytic’ and ‘continental’ philosophy obscures the plurality of philosophical approaches involved. Royaumont was the meeting point of more than two philosophical traditions, as can be shown by the divergent interests of its participants. Thus, though the potential for rapprochement between Oxford ‘linguistic philosophy’ and a certain strand of phenomenological thought may indeed be found among the discussions that took place during the colloquium, one should keep in mind that such rapprochement took place in the context of a meeting between, among others: continental ‘analytics’, Anglophone non-‘analytics’, French historians of philosophy, ‘analytic’ opponents of Oxford philosophy, Franciscan phenomenologists, and Oxonians who called their work ‘phenomenology’. (shrink)

Theoria, Volume 87, Issue 1, Page 87-108, February 2021.

Setting out to understand Frege, the scholar confronts a roadblock at the outset: We just have little to go on. Much of the unpublished work and correspondence is lost, probably forever. Even the most basic task of imagining Frege's intellectual life is a challenge. The people he studied with and those he spent daily time with are little known to historians of philosophy and logic. To be sure, this makes it hard to answer broad questions like: 'Who influenced Frege?' But (...) the information vacuum also creates local problems of textual interpretation. Say we encounter a sentence that may be read as alluding to a scientific dispute. Should it be read that way? To answer, we'd need to address prior questions. Is it .. (shrink)

The purpose of this article is to examine aspects of the development of the concept and theory of computability through the theory of recursive functions. Following a brief introduction, Section 2 is devoted to the presuppositions of computability. It focuses on certain concepts, beliefs and theorems necessary for a general property of computability to be formulated and developed into a mathematical theory. The following two sections concern situations in which the presuppositions were realized and the theory of computability was developed. (...) It is suggested in Section 3 that a central item was the problem of generalizing Gödel's incompleteness theorem. It is shown that this involved both the characterization of recursiveness and the attempt to clarify and formulate the notion of an effective process as it relates to the syntax of deductive systems. Section 4 concerns the decision problems which grew from the Hilbert program. Section 5 is devoted to the development of an informal' technique in the theory of computability often called ?argument by Church's thesis? (shrink)

The paper seeks to answer two new questions about truth and scientific change: What lessons does the phenomenon of scientific change teach us about the nature of truth? What light do recent developments in the theory of truth, incorporating these lessons, throw on problems arising from the prevalence of scientific change, specifically, the problem of pessimistic meta-induction?

Philosophers are divided on whether the proof- or truth-theoretic approach to logic is more fruitful. The paper demonstrates the considerable explanatory power of a truth-based approach to logic by showing that and how it can provide (i) an explanatory characterization —both semantic and proof-theoretical—of logical inference, (ii) an explanatory criterion for logical constants and operators, (iii) an explanatory account of logic’s role (function) in knowledge, as well as explanations of (iv) the characteristic features of logic —formality, strong modal force, generality, (...) topic neutrality, basicness, and (quasi-)apriority, (v) the veridicality of logic and its applicability to science, (v) the normativity of logic, (vi) error, revision, and expansion in/of logic, and (vii) the relation between logic and mathematics. The high explanatory power of the truth-theoretic approach does not rule out an equal or even higher explanatory power of the proof-theoretic approach. But to the extent that the truth-theoretic approach is shown to be highly explanatory, it sets a standard for other approaches to logic, including the proof-theoretic approach. (shrink)

The paper presents an outline of a unified answer to five questions concerning logic: (1) Is logic in the mind or in the world? (2) Does logic need a foundation? What is the main obstacle to a foundation for logic? Can it be overcome? (3) How does logic work? What does logical form represent? Are logical constants referential? (4) Is there a criterion of logicality? (5) What is the relation between logic and mathematics?

It is easy to show that in many natural axiomatic formulations of physical and even mathematical theories, there are many superfluous concepts usually assumed as primitive. This happens mainly when these theories are formulated in the language of standard set theories, such as Zermelo–Fraenkel’s. In 1925, John von Neumann created a set theory where sets are definable by means of functions. We provide a reformulation of von Neumann’s set theory and show that it can be used to formulate physical and (...) mathematical theories with a lower number of primitive concepts very naturally. Our basic proposal is to offer a new kind of set-theoretic language that offers advantages with respect to the standard approaches, since it doesn’t introduce dispensable primitive concepts. We show how the proposal works by considering significant physical theories, such as non-relativistic classical particle mechanics and classical field theories, as well as a well-known mathematical theory, namely, group theory. This is a first step of a research program we intend to pursue. (shrink)

C. S. Jenkins has recently proposed an account of arithmetical knowledge designed to be realist, empiricist, and apriorist: realist in that what’s the case in arithmetic doesn’t rely on us being any particular way; empiricist in that arithmetic knowledge crucially depends on the senses; and apriorist in that it accommodates the time-honored judgment that there is something special about arithmetical knowledge, something we have historically labeled with ‘a priori’. I’m here concerned with the prospects for extending Jenkins’s account beyond arithmetic—in (...) particular, to set theory. After setting out the central elements of Jenkins’s account and entertaining challenges to extending it to set theory, I conclude that a satisfactory such extension is unlikely. (shrink)

Volume 52, Issue 9, August 2020, Page 918-922.

In the 1978 volume of Process Studies, Nancy Frankenberry published an article called “The Empirical Dimension of Religious Experience” that I thought was so good that I wrote her a short fan letter about it.1 She responded by saying that she was flattered by my praise because I was a model for her younger generation. For the first time in my life I felt old. And I wasn’t yet forty. But here I am, still fully employed, presenting a long fan (...) letter at her retirement. Nice irony! I want to begin laying out some of the themes and accomplishments of her distinguished career as a model philosopher of religion by discussing her early book Religion and Radical Empiricism.2 The context in which she wrote.. (shrink)

Developing some suggestions of Ramsey (1925), elementary logic is formulated with respect to an arbitrary categorial system rather than the categorial system of Logical Atomism which is retained in standard elementary logic. Among the many types of non-standard categorial systems allowed by this formalism, it is argued that elementary logic with predicates of variable degree occupies a distinguished position, both for formal reasons and because of its potential value for application of formal logic to natural language and natural science. This (...) is illustrated by use of such a logic to construct a theory of quantity which is argued to be scientifically superior to existing theories of quantity based on standard categorial systems, since it yields real-valued scales without the need for unrealistic existence assumptions. This provides empirical evidence for the hypothesis that the categorial structure of the physical world itself is non-standard in this sense. (shrink)

In this paper, we focus on the launch of the Great Soviet Encyclopedia, which was first published in 1925. We present the context of the launch and explain why it was closely connected to the period of the New Economic Policy. In the last section, we examine four articles about randomness and probability included in the first volumes of the encyclopedia in order to illustrate some debates from within the scientific scene in the USSR during the 1920s.

My aim in this paper is to propose what seems to me a distinctive approach to set theoretic methodology. By ‘methodology’ I mean the study of the actual methods used by practitioners, the study of how these methods might be justified or reformed or extended. So, for example, when the intuitionist's philosophical analysis recommends a wholesale revision of the methods of proof used in classical mathematics, this is a piece of reformist methodology. In contrast with the intuitionist, I will focus (...) more narrowly on the methods of contemporary set theory, and, more importantly, I will certainly recommend no sweeping reforms. Rather, I begin from the assumption that the methodologist's job is to account for set theory as it is practiced, not as some philosophy would have it be. This credo lies at the very heart of the so-called ‘naturalism’ to be described here.A philosopher looking at set theoretic practice from the outside, so to speak, might notice any number of interesting methodological questions, beginning with the intuitionist's ‘why use classical logic?’, but this sort of question is not a live issue for most practicing set theorists. One central question on which the philosopher's and the practitioner's interests converge is this: what is the status of independent statements like the continuum hypothesis (CH)? A number of large questions arise in its wake: what criteria should guide the search for new axioms? For that matter, what reasons support our adoption of the old axioms? (shrink)

This paper is dedicated to Alonzo Church, who died in August 1995 after a long life devoted to logic. To Church we owe lambda calculus, the thesis bearing his name and the solution to the Entscheidungsproblem.His well-known book Introduction to Mathematical LogicI, defined the subject matter of mathematical logic, the approach to be taken and the basic topics addressed. Church was the creator of the Journal of Symbolic Logicthe best-known journal of the area, which he edited for several decades This (...) paper is in three sections. The first is written in journalistic style:the story of the life of AlonzoChurch is told, including some of the many anecdotes I have collected from different sources. The secondpart is devoted to his work, but is far from being exhaustive. The last part is more original; in it I attempto show that Church’s great discovery was lambda calculus and that his remaining contributions weremainly inspired afterthoughts in the sense that most of his contributions as well as some of his pupils derivefrom that initial achievement. Included are Kleene’s Recursion Theory and the completeness proof ofHenkin. I have added an appendix in which is presented the typed lambda calculus and a proof of theundecidability of first-order logic. (shrink)

As an undergraduate I was taught to multiply two numbers with the help of log tables, using the formulaHaving graduated to teach calculus to Engineers, I learned that log tables were to be replaced by slide rules. It was then that Imade the fateful decision that there was no need for me to learn how to use this tedious device, as I could always rely on the students to perform the necessary computations. In the course of time, slide rules were (...) replaced by pocket calculators and personal computers, but I stuck to my original decision.My computer phobia did not prevent me from taking an interest in the theoretical question: what is a computation? This question goes back to Hilbert's 10th problem, which asks for an algorithm, or computational procedure, to decide whether any given polynomial equation is solvable in integers. It quickly leads to the related question: which numerical functionsf: ℕn→ ℕ are computable?While Hilbert's 10th problem was only resolved in 1970, this related question had some earlier answers, of which I shall single out the following three:f is recursive,f is computable on an abstract machine,f is definable in the untyped λ-calculus.These tentative answers were shown to be equivalent by Church [1936] and Turing [1936–7].I shall discuss here some of the more recent developments of these notions of computability and their relevance to linguistics and logic. I hope to be forgiven for dwelling on some of the work I have been involved with personally, with greater emphasis than is justified by its historical significance. (shrink)

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–1905—surely unknown to Church—contain a more extensive anticipation of the essential details of the lambda calculus. Russell also anticipated Schönfinkel's combinatory logic approach of treating multiargument 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 Russell’s paradox. In this article, I explore the genesis and demise of Russell’s early anticipation of the lambda calculus. (shrink)

The aim of this paper is to provide the beginnings of a theory of justification. This theory is an alternative to the two currently available and unsatisfactory options: foundationalism and coherentism. Both of these theories, as well as the decisive sceptical objections to them, are committed to the assumption that there is only one context of justification and only one standard of justification. This assumption is mistaken. There are two contexts of justification, each with a standard peculiar to it. The (...) consequence of this is the need for a radical reorientation in epistemology. (shrink)

In this paper we will state and prove some comparative theorems concerning PRA and IΣ1. We shall provide a characterization of IΣ1 in terms of PRA and iterations of a class of functions. In particular, we prove that for this class of functions the difference between IΣ1 and PRA is exactly that, where PRA is closed under iterations of these functions, IΣ1 is moreover provably closed under iteration. We will formulate a sufficient condition for a model of PRA to be (...) a model of IΣ1. This condition is used to give a model-theoretic proof of Parsons’ theorem, that is, IΣ1 is Π2-conservative over PRA. We shall also give a purely syntactical proof of Parsons’ theorem. Finally, we show that IΣ1 proves the consistency of PRA on a definable IΣ1-cut. This implies that proofs in IΣ1 can have non-elementary speed up over proofs in PRA. (shrink)

When we use a directly referential expression to denote an object, do we incur an ontological commitment to that object, as Russell and Barcan Marcus held? Not according to Quine, whose regimented language has only variables as denoting expressions, but no constants to model direct reference. I make a case for a more liberal conception of ontological commitment—more wide-ranging than Quine’s—which allows for commitment to individuals, with an improved logical language of regimentation. The reason for Quine’s prohibition on commitment to (...) individuals, I argue, is that his choice of regimented language is heavily informed by his holist epistemology, in which objects are introduced via a description of their explanatory role. But non-holists can coherently attempt to commit to individuals using directly referential expressions, modelled in a formal language as constants. While holding on to the insight that a logical language is a helpful medium for ontology, I propose instead a more permissive language of regimentation, one expanded to permit the use of constants to record attempts to commit to individuals, which allows us to make sense of non-holist theories with alternative name-based or name-and-variable-based criteria of ontological commitment as well as Quinean theories. (shrink)

Nominal logic is a variant of first-order logic in which abstract syntax with names and binding is formalized in terms of two basic operations: name-swapping and freshness. It relies on two important principles: equivariance (validity is preserved by name-swapping), and fresh name generation ("new" or fresh names can always be chosen). It is inspired by a particular class of models for abstract syntax trees involving names and binding, drawing on ideas from Fraenkel-Mostowski set theory: finite-support models in which each value (...) can depend on only finitely many names. Although nominal logic is sound with respect to such models, it is not complete. In this paper we review nominal logic and show why finite-support models are insufficient both in theory and practice. We then identify (up to isomorphism) the class of models with respect to which nominal logic is complete: ideal-supported models in which the supports of values are elements of a proper ideal on the set of names. We also investigate an appropriate generalization of Herbrand models to nominal logic. After adjusting the syntax of nominal logic to include constants denoting names, we generalize universal theories to nominal-universal theories and prove that each such theory has an Herbrand model. (shrink)

The paper analyses Frege's approach to the identity conditions for the entity labelled by him as Sinn. It starts with a brief characterization of the main principles of Frege's semantics and lists his remarks on the identity conditions for Sinn. They are subject to a detailed scrutiny, and it is shown that, with the exception of the criterion of intersubstitutability in oratio obliqua, all other criteria have to be discarded. Finally, by comparing Frege's views on Sinn with Carnap's method of (...) extension and intension and the method of intensional isomorphism, it is proved that these methods do not provide a criterion for the identity of Frege's Sinn, even for extensional contexts, that the concept of intension does not coincide, as stated by Carnap, in these contexts, with Frege's concept of Sinn, and that Carnap's claim that in oratio obliqua Frege's semantics leads to an infinite hierarchy of Sinn entities can be questioned at least hypothetically in the light of certain new historical facts. (shrink)

It is sometimes objected that anti-individualism, because of its assumption of the constitutive role of natural and social environments in the individuation of intentional attitudes, raises sceptical worries about first-person authority--that peculiar privilege each of us is thought to enjoy with respect to non-Socratic self-knowledge. Gary Ebbs believes that this sort of objection can be circumvented, if we give up metaphysical realism and scientific naturalism and adopt what he calls a “participant perspective” on our linguistic practices. Drawing on broadly Wittgensteinian (...) considerations, I argue that Ebbs is right about this, and I show how two likely objections to his view can be circumvented. I also argue that mere adoption of the participant perspective does not serve to refute external-world sceptic. (shrink)

The paper exposes the philosophical and mathematical flaws in an attempt to settle the continuum problem by a new class of axioms based on probabilistic reasoning. I also examine the larger proposal behind this approach, namely the introduction of new primitive notions that would supersede the set theoretic foundation of mathematics.

The paper exposes the philosophical and mathematical flaws in an attempt to settle the continuum problem by a new class of axioms based on probabilistic reasoning. I also examine the larger proposal behind this approach, namely the introduction of new primitive notions that would supersede the set theoretic foundation of mathematics.

There have been several different and even opposed conceptions of the problem of logical constants, i.e. of the requirements that a good theory of logical constants ought to satisfy. This paper is in the first place a survey of these conceptions and a critique of the theories they have given rise to. A second aim of the paper is to sketch some ideas about what a good theory would look like. A third aim is to draw from these ideas and (...) from the preceding survey the conclusion that most conceptions of the problem of logical constants involve requirements of a philosophically demanding nature which are probably not satisfiable by any minimally adequate theory. (shrink)

In Sein und Zeit Heidegger makes several claims about the nature of ‘assertion’ [Aussage]. These claims are of particular philosophical interest: they illustrate, for example, important points of contact and divergence between Heidegger's work and philosophical movements including Kantianism, the early Analytic tradition and contemporary pragmatism. This article provides a new assessment of one of these claims: that assertion is connected to a ‘present-at-hand’ ontology. I also indicate how my analysis sets the stage for a new reading of Heidegger's further (...) claim that assertion is an explanatorily derivative phenomenon. I begin with a loose overview of Heidegger's position and then develop a sharper formulation of the key premises. I go on to argue that existing treatments of the supposed link between assertion and the ‘present-at-hand’ are unsatisfactory, and advance a new, ‘methodological’, interpretation of that link. Finally, I sketch the implications of my interpretation for the further claim that assertion is explanatorily derivative. (shrink)

In this article, I wish to discuss in an informal way the motivations and the motifs of the constructivist approach to logic and mathematics and by a natural extension to the general field of science, particularly theoretical physics. Foundational questions in those domains are not ruled by philosophical principles, but a critical philosophy of foundations could be the leitmotiv to the extent that it can be used as a criterion to decide between the theoretical options of scientific practices that are (...) often oblivious to their own doctrinal presuppositions. My objective is to provide the justificatory reasons for a constructivist option or posture in the field of scientific knowledge. (shrink)

In this paper I will try to defend a quasi-naturalistic interpretation of J.L. Austin’s work. I will rely on P. Kitcher’s 1992 paper “The Naturalists Return” to compile four general criteria by which a philosopher can be called a naturalist. Then I will turn to Austin’s work and examine whether he meets these criteria. I will try to claim that versions of such naturalistic elements can be found in his work.