This book presents novel formalizations of three of the most important medieval logical theories: supposition, consequence and obligations. In an additional fourth part, an in-depth analysis of the concept of formalization is presented - a crucial concept in the current logical panorama, which as such receives surprisingly little attention.Although formalizations of medieval logical theories have been proposed earlier in the literature, the formalizations presented here are all based on innovative vantage points: supposition theories as algorithmic hermeneutics, theories of consequence analyzed (...) with tools borrowed from model-theory and two-dimensional semantics, and obligations as logical games. For this reason, this is perhaps the first time that these medieval logical theories are made fully accessible to the modern philosopher and logician who wishes to obtain a better grasp of them, but who has always been held back by the lack of appropriate ‘translations' into modern terms.Moreover, the book offers a reflection on the very nature of logic, a reflection that is prompted by the comparisons between medieval and modern logic, their similarities and dissimilarities. It is thus a contribution not only to the history of logic, but also to the philosophy of logic, the philosophy of language and semantics.The analysis of medieval logic is also relevant for the modern philosopher and logician in that, being the unifying methodology used across all disciplines at that time, logic really provided unity to science. It thus presents a unified model of scientific investigation, where logic plays the aggregating role. (shrink)

On a widespread naturalist view, the meanings of mathematical terms are determined, and can only be determined, by the way we use mathematical language—in particular, by the basic mathematical principles we’re disposed to accept. But it’s mysterious how this can be so, since, as is well known, minimally strong first-order theories are non-categorical and so are compatible with countless non-isomorphic interpretations. As for second-order theories: though they typically enjoy categoricity results—for instance, Dedekind’s categoricity theorem for second-order and Zermelo’s quasi-categoricity theorem (...) for second-order —these results require full second-order logic. So appealing to these results seems only to push the problem back, since the principles of second-order logic are themselves non-categorical: those principles are compatible with restricted interpretations of the second-order quantifiers on which Dedekind’s and Zermelo’s results are no longer available. In this paper, we provide a naturalist-friendly, non-revisionary solution to an analogous but seemingly more basic problem—Carnap’s Categoricity Problem for propositional and first-order logic—and show that our solution generalizes, giving us full second-order logic and thereby securing the categoricity or quasi-categoricity of second-order mathematical theories. Briefly, the first-order quantifiers have their intended interpretation, we claim, because we’re disposed to follow the quantifier rules in an open-ended way. As we show, given this open-endedness, the interpretation of the quantifiers must be permutation-invariant and so, by a theorem recently proved by Bonnay and Westerståhl, must be the standard interpretation. Analogously for the second-order case: we prove, by generalizing Bonnay and Westerståhl’s theorem, that the permutation invariance of the interpretation of the second-order quantifiers, guaranteed once again by the open-endedness of our inferential dispositions, suffices to yield full second-order logic. (shrink)

Brouwer’s view on induction has relatively recently been characterised as one on which it is not only intuitive (as expected) but functional, by van Dalen. He claims that Brouwer’s ‘Ur-intuition’ also yields the recursor. Appealing to Husserl’s phenomenology, I offer an analysis of Brouwer’s view that supports this characterisation and claim, even if assigning the primary role to the iterator instead. Contrasts are drawn to accounts of induction by Poincaré, Heyting, and Kreisel. On the phenomenological side, the analysis provides an (...) alternative to that in Tieszen’s Mathematical Intuition, and confirms a view of Gödel on his Dialectica Interpretation. (shrink)

This volume will be of particular interest to researchers working in the history, and in the philosophy, of logic and mathematics, and more generally, to ...

Part 1 sets out the logical/semantical background to ‘On Denoting’, including an exposition of Russell's views in Principles of Mathematics, the role and justification of Frege's notorious Axiom V, and speculation about how the search for a solution to the Contradiction might have motivated a new treatment of denoting. Part 2 consists primarily of an extended analysis of Russell's views on knowledge by acquaintance and knowledge by description, in which I try to show that the discomfiture between Russell's semantical and (...) epistemological commitments begins as far back as 1903. I close with a non-Russellian critique of Russell's views on how we are able to make use of linguistic representations in thought and with the suggestion that a theory of comprehension is needed to supplement semantic theory. (shrink)

David Hilbert’s early foundational views, especially those corresponding to the 1890s, are analysed here. I consider strong evidence for the fact that Hilbert was a logicist at that time, following upon Dedekind’s footsteps in his understanding of pure mathematics. This insight makes it possible to throw new light on the evolution of Hilbert’s foundational ideas, including his early contributions to the foundations of geometry and the real number system. The context of Dedekind-style logicism makes it possible to offer a new (...) analysis of the emergence of Hilbert’s famous ideas on mathematical existence, now seen as a revision of basic principles of the “naive logic” of sets. At the same time, careful scrutiny of his published and unpublished work around the turn of the century uncovers deep differences between his ideas about consistency proofs before and after 1904. Along the way, we cover topics such as the role of sets and of the dichotomic conception of set theory in Hilbert’s early axiomatics, and offer detailed analyses of Hilbert’s paradox and of his completeness axiom (Vollständigkeitsaxiom). (shrink)

Hilbert's program attempts to show that our mathematical knowledge can be certain because we are able to know for certain the truths of elementary arithmetic. I argue that, in the absence of a theory of mathematical truth, Hilbert does not have a complete theory of our arithmetical knowledge. Further, while his deployment of a Kantian notion of intuition seems to promise an answer to scepticism, there is no way to complete Hilbert's epistemology which would answer to his avowed aims.

This paper challenges two orthodox theses: (a) that computational processes must be algorithmic; and (b) that all computed functions must be Turing-computable. Section 2 advances the claim that the works in computability theory, including Turing's analysis of the effective computable functions, do not substantiate the two theses. It is then shown (Section 3) that we can describe a system that computes a number-theoretic function which is not Turing-computable. The argument against the first thesis proceeds in two stages. It is first (...) shown (Section 4) that whether a process is algorithmic depends on the way we describe the process. It is then argued (Section 5) that systems compute even if their processes are not described as algorithmic. The paper concludes with a suggestion for a semantic approach to computation. (shrink)

This paper explores the relationship borne by the traditional paradoxes of set theory and semantics to formal incompleteness phenomena. A central tool is the application of the Arithmetized Completeness Theorem to systems of second-order arithmetic and set theory in which various “paradoxical notions” for first-order languages can be formalized. I will first discuss the setting in which this result was originally presented by Hilbert & Bernays (1939) and also how it was later adapted by Kreisel (1950) and Wang (1955) in (...) order to obtain formal undecidability results. A generalization of this method will then be presented whereby Russell’s paradox, a variant of Mirimanoff’s paradox, the Liar, and the Grelling–Nelson paradox may be uniformly transformed into incompleteness theorems. Some additional observations are then framed relating these results to the unification of the set theoretic and semantic paradoxes, the intensionality of arithmetization (in the sense of Feferman, 1960), and axiomatic theories of truth. (shrink)

Set theory is an autonomous and sophisticated field of mathematics, enormously successful not only at its continuing development of its historical heritage but also at analyzing mathematical propositions cast in set-theoretic terms and gauging their consistency strength. But set theory is also distinguished by having begun intertwined with pronounced metaphysical attitudes, and these have even been regarded as crucial by some of its great developers. This has encouraged the exaggeration of crises in foundations and of metaphysical doctrines in general. However, (...) set theory has proceeded in the opposite direction, from a web of intensions to a theory of extensionpar excellence, and like other fields of mathematics its vitality and progress have depended on a steadily growing core of mathematical structures and methods, problems and results. There is also the stronger contention that from the beginning set theory actually developed through a progression ofmathematicalmoves, whatever and sometimes in spite of what has been claimed on its behalf.What follows is an account of the development of set theory from its beginnings through the creation of forcing based on these contentions, with an avowedly Whiggish emphasis on the heritage that has been retained and developed by current set theory. The whole transfinite landscape can be viewed as the result of Cantor's attempt to articulate and solve the Continuum Problem. (shrink)

The Hilbert program was actually a specific approach for proving consistency, a kind of constructive model theory. Quantifiers were supposed to be replaced by ε-terms. εxA(x) was supposed to denote a witness to ∃xA(x), or something arbitrary if there is none. The Hilbertians claimed that in any proof in a number-theoretic system S, each ε-term can be replaced by a numeral, making each line provable and true. This implies that S must not only be consistent, but also 1-consistent. Here we (...) show that if the result is supposed to be provable within S, a statement about all Pi-0-2 statements that subsumes itself within its own scope must be provable, yielding a contradiction. The result resembles Gödel's but arises naturally out of the Hilbert program itself. (shrink)

This book attempts to explicate and expand upon Frank Ramsey's notion of the realistic spirit. In so doing, it provides a systematic reading of his work, and demonstrates the extent of Ramsey's genius as evinced by both his responses to the Tractatus Logico-Philosophicus , and the impact he had on Wittgenstein's later philosophical insights.

ABSTRACT This paper reveals David Hilbert’s position in the philosophy of mathematics, circa 1900, to be a form of non-eliminative structuralism, predating his formalism. I argue that Hilbert withstands the pressing objections put to him by Frege in the course of the Frege-Hilbert controversy in virtue of this early structuralist approach. To demonstrate that this historical position deserves contemporary attention I show that Hilbertian structuralism avoids a recent wave of objections against non-eliminative structuralists to the effect that they cannot distinguish (...) between structurally identical but importantly distinct mathematical objects, such as the complex roots of $-1$. (shrink)

Natural Formalization proposes a concrete way of expanding proof theory from the meta-mathematical investigation of formal theories to an examination of “the concept of the specifically mathematical proof.” Formal proofs play a role for this examination in as much as they reflect the essential structure and systematic construction of mathematical proofs. We emphasize three crucial features of our formal inference mechanism: (1) the underlying logical calculus is built for reasoning with gaps and for providing strategic directions, (2) the mathematical frame (...) is a definitional extension of Zermelo–Fraenkel set theory and has a hierarchically organized structure of concepts and operations, and (3) the construction of formal proofs is deeply connected to the frame through rules for definitions and lemmas. To bring these general ideas to life, we examine, as a case study, proofs of the Cantor–Bernstein Theorem that do not appeal to the principle of choice. A thorough analysis of the multitude of “different” informal proofs seems to reduce them to exactly one. The natural formalization confirms that there is one proof, but that it comes in two variants due to Dedekind and Zermelo, respectively. In this way it enhances the conceptual understanding of the represented informal proofs. The formal, computational work is carried out with the proof search system AProS that serves as a proof assistant and implements the above inference mechanism; it can be fully inspected at (see link below). (shrink)

Ayda Ignez Arruda was a key figure in the development of the Brazilian school of Paraconsistent logic and the first person to write a historical survey of the field. Despite her importa...

The incompleteness theorems constitute the mathematical core of Gödel’s philosophical challenge. They are given in their “most satisfactory form”, as Gödel saw it, when the formality of theories to which they apply is characterized via Turing machines. These machines codify human mechanical procedures that can be carried out without appealing to higher cognitive capacities. The question naturally arises, whether the theorems justify the claim that the human mind has mathematical abilities that are not shared by any machine. Turing admits that (...) non-mechanical steps of intuition are needed to transcend particular formal theories. Thus, there is a substantive point in comparing Turing’s views with Gödel’s that is expressed by the assertion, “The human mind infinitely surpasses any finite machine”. The parallelisms and tensions between their views are taken as an inspiration for beginning to explore, computationally, the capacities of the human mathematical mind. (shrink)

In Transparent Intensional Logic we can recognize two distinct notions of computation that loosely correspond to term rewriting and term interpretation as known from lambda calculus. Our goal will be to further explore these two notions and examine some of their properties.

The concept of “necessity of thought” plays a central role in Dag Prawitz’s essay “Logical Consequence from a Constructivist Point of View” (Prawitz 2005). The theme is later developed in various articles devoted to the notion of valid inference (Prawitz, 2009, forthcoming a, forthcoming b). In section 1 I explain how the notion of necessity of thought emerges from Prawitz’s analysis of logical consequence. I try to expound Prawitz’s views concerning the necessity of thought in sections 2, 3 and 4. (...) In sections 5 and 6 I discuss some problems arising with regard to Prawitz’s views. (shrink)

Kurt Gödel with his work on the constructible universeLestablished the relative consistency of the Axiom of Choice and the Continuum Hypothesis. More broadly, he ensured the ascendancy of first-order logic as the framework and a matter of method for set theory and secured the cumulative hierarchy view of the universe of sets. Gödel thereby transformed set theory and launched it with structured subject matter and specific methods of proof. In later years Gödel worked on a variety of set theoretic constructions (...) and speculated about how problems might be settled with new axioms. We here chronicle this development from the point of view of the evolution of set theory as a field of mathematics. Much has been written, of course, about Gödel's work in set theory, from textbook expositions to the introductory notes to his collected papers. The present account presents an integrated view of the historical and mathematical development as supported by his recently published lectures and correspondence. Beyond the surface of things we delve deeper into the mathematics. What emerges are the roots and anticipations in work of Russell and Hilbert, and most prominently the sustained motif of truth as formalizable in the “next higher system”. We especially work at bringing out how transforming Gödel's work was for set theory. It is difficult now to see what conceptual and technical distance Gödel had to cover and how dramatic his re-orientation of set theory was. (shrink)

One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.

The first part of the paper introduces the varieties of modern constructive mathematics, concentrating on Bishop's constructive mathematics (BISH). it gives a sketch of both Myhill's axiomatic system for BISH and a constructive axiomatic development of the real line R. The second part of the paper focusses on the relation between constructive mathematics and programming, with emphasis on Martin-L6f 's theory of types as a formal system for BISH.

Set theory, it has been contended, developed from its beginnings through a progression ofmathematicalmoves, despite being intertwined with pronounced metaphysical attitudes and exaggerated foundational claims that have been held on its behalf. In this paper, the seminal results of set theory are woven together in terms of a unifying mathematical motif, one whose transmutations serve to illuminate the historical development of the subject. The motif is foreshadowed in Cantor's diagonal proof, and emerges in the interstices of the inclusion vs. membership (...) distinction, a distinction only clarified at the turn of this century, remarkable though this may seem. Russell runs with this distinction, but is quickly caught on the horns of his well-known paradox, an early expression of our motif. The motif becomes fully manifest through the study of functionsof the power set of a set into the set in the fundamental work of Zermelo on set theory. His first proof in 1904 of his Well-Ordering Theoremis a central articulation containing much of what would become familiar in the subsequent development of set theory. Afterwards, the motif is cast by Kuratowski as a fixed point theorem, one subsequently abstracted to partial orders by Bourbaki in connection with Zorn's Lemma. Migrating beyond set theory, that generalization becomes cited as the strongest of fixed point theorems useful in computer science.Section 1 describes the emergence of our guiding motif as a line of development from Cantor's diagonal proof to Russell's Paradox, fueled by the clarification of the inclusion vs. membership distinction. Section 2 engages the motif as fully participating in Zermelo's work on the Well-Ordering Theorem and as newly informing on Cantor's basic result that there is no bijection. Then Section 3 describes in connection with Zorn's Lemma the transformation of the motif into an abstract fixed point theorem, one accorded significance in computer science. (shrink)

There are two principles that lend Brouwer's mathematics the extra power beyond arithmetic. Both are presented in Brouwer's writings with little or no argument. One, the principle of bar induction, will not concern us here. The other, the continuity principle for numbers, occurs for the first time in print in [4]. It is formulated and immediately applied to show that the set of numerical choice sequences is not enumerable. In fact, the idea of the continuity property can be dated fairly (...) precisely, it is to be found in the margin of Brouwer's notes for his course on Pointset Theory of 1915/16. The course was repeated in 1916/17 and he must have inserted his first formulation of the continuity principle in the fall of 1916 as new material right at the beginning of the course.In modern language, the principle readswhere α and β range over choice sequences of natural numbers, m and x over natural numbers, and stands for ⟨α, α, …, α⟩, the initial segment of α of length m.An immediate consequence of WC-N is that all full functions are continuous, and, as a corollary, that the continuum is unsplittable [28]. Note that WC-N is incompatible with Church's thesis, [22], section 4.6.After Brouwer asserted WC-N, Troelstra was the first to ask in print for a conceptual motivation, but he remained an exception; most authors followed Brouwer by simply asserting it, cf. [18].Let us note first that in one particular case the principle is obvious indeed, namely in the case of the lawless sequences. The notion of lawless sequence surfaced fairly late in the history of intuitionism. Kreisel introduced it in [17] for metamathematical purposes. There is a letter from Brouwer to Heyting in which the phenomenon also occurs [7]. This is an important and interesting fact since it is the only time that Brouwer made use of a possibility expressly stipulated in, e.g., [5], see below. (shrink)

This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...) introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three “dogmas of proof-theoretic semantics” are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of p roofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence. (shrink)

Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...) foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

This article presents an overview of the basic philosophical motivations for, and some recent work in, modal set theory.

In 1902 there arrived in Jena a letter from Russell laying out a proof that shattered Frege’s confidence in logicism, which is widely taken to be the doctrine according to which every truth of arithmetic is re-expressible without relevant loss as a provable truth about a purely logical object. Frege was persuaded that Russell had exposed a pathology in logicism, which faced him with the task of examining its symptoms, diagnosing its cause, assessing its seriousness, arriving at a treatment option, (...) and making an estimate of future prospects. The symptom was the contradiction that had crept into naïve set theory in the form of the set that provably is and is not its own member. The diagnosis was that it is caused by Basic Law V of the Grundgesetze (Frege, In: Grundgesetze der Arithmetik: Begrifsschriftlich abgeleitet, Jena: Herman Pohle, 1893/1903. Translated into English as Basic Laws of Arithmetic, also edited by Philip A. Ebert and Marcus Rossberg, with Crispin Wright, Oxford: Oxford University Press, 2013). Triage answers the question, “How bad is it?” The answer was that the contradiction irreparably destroys the logicist project. The treatment option was nil. The disease was untreatable. In due course, the prognosis turned out to be that a scaled-down Fregean logic could have an honourable life as a theory inference for various domains of mathematical discourse, but not for domains containing the logical objects required for logicism. Since there aren’t such objects, there aren’t such domains. On the face of it, Frege’s logicist collapse is astonishing. Why wouldn’t he have repaired the fault in Law V and gone back to the business of bringing logicism to an assured realization? In the course of our reflections, we will have nice occasion to consider the good it might have done Frege to have booked some time with Aristotle had he been able to. By the time we’re finished, we’ll have cause to think that in the end the Russell might well have begged the question against Frege. (shrink)

A detailed argument is provided for the thesis that Dedekind was a logicist about arithmetic. The rules of inference employed in Dedekind's construction of arithmetic are, by his lights, all purely logical in character, and the definitions are all explicit; even the definition of the natural numbers as the abstract type of simply infinite systems can be seen to be explicit. The primitive concepts of the construction are logical in their being intrinsically tied to the functioning of the understanding.

This paper discusses George Boole’s two distinct approaches to the explanatory relationship between logical and psychological theory. It is argued that, whereas in his first book he attributes a substantive role to psychology in the foundation of logical theory, in his second work he abandons that position in favour of a linguistically conceived foundation. The early Boole espoused a type of psychologism and later came to adopt a type of anti-psychologism. To appreciate this invites a far-reaching reassessment of his philosophy (...) of logic. (shrink)

This paper engages the question ‘Does the consistency of a set of axioms entail the existence of a model in which they are satisfied?’ within the frame of the Frege-Hilbert controversy. The question is related historically to the formulation, proof and reception of Gödel’s Completeness Theorem. Tools from mathematical logic are then used to argue that there are precise senses in which Frege was correct to maintain that demonstrating consistency is as difficult as it can be, but also in which (...) Hilbert was correct to maintain that demonstrating existence given consistency is as easy as it can be. (shrink)

All contributions included in the present issue were originally presented at an ‘Author Meets Critics’ session organised by Richard Zach at the Pacific Meeting of the American Philosophical Association in San Diego in the Spring of 2014.

It is widely assumed that Russell's problems with the unity of the proposition were recurring and insoluble within the framework of the logical theory of his Principles of Mathematics. By contrast, Frege's functional analysis of thoughts (grounded in a type-theoretic distinction between concepts and objects) is commonly assumed to provide a solution to the problem or, at least, a means of avoiding the difficulty altogether. The Fregean solution is unavailable to Russell because of his commitment to the thesis that there (...) is only one ultimate ontological category. This, combined with Russell's reification of propositions, ensures that he must hold concepts and objects to be of the same logical and ontological type. In this paper I argue that, while Frege's treatment of the unity of the proposition has immediate advantages over Russell's, a deeper consideration of the philosophical underpinnings and metaphysical consequences of the two approaches reveals that Frege's supposed solution is, in fact, far from satisfactory. Russell's repudiation of the Fregean position in the Principles is, I contend, convincing and Russell's own position, despite its problems, conforms to a greater extent than Frege's with common sense and, furthermore, with certain ideas which are central to our understanding of the origins of the analytical tradition. (shrink)

The study of propositional realizability logic was initiated in the 50th of the last century. Some interesting results were obtained in the 60-70th. but many important problems in this area are still open. Now interest to these problems from new generation of researchers is observed. This survey contains an exposition of the results on propositional realizability logic and corresponding techniques. Thus reading this paper can be the start point in exploring and development of constructive logic.

Our regimentation of Goodman and Myhill’s proof of Excluded Middle revealed among its premises a form of Choice and an instance of Separation.Here we revisit Zermelo’s requirement that the separating property be definite. The instance that Goodman and Myhill used is not constructively warranted. It is that principle, and not Choice alone, that precipitates Excluded Middle.Separation in various axiomatizations of constructive set theory is examined. We conclude that insufficient critical attention has been paid to how those forms of Separation fail, (...) in light of the Goodman–Myhill result, to capture a genuinely constructive notion of set. (shrink)

In many accounts of the history of logic, especially from the second half of the twentieth century and partly still today, Frege’s first book, Begriffsschrift (1879), is singled out as the beginnin...

Georg Cantor's absolute infinity, the paradoxical Burali-Forti class Ω of all ordinals, is a monstrous non-entity for which being called a "class" is an undeserved dignity. This must be the ultimate vexation for mathematical philosophers who hold on to some residual sense of realism in set theory. By careful use of Ω, we can rescue Georg Cantor's 1899 "proof" sketch of the Well-Ordering Theorem––being generous, considering his declining health. We take the contrapositive of Cantor's suggestion and add Zermelo's choice function. (...) This results in a concise and uncomplicated proof of the Well-Ordering Theorem. (shrink)

Transitive extensional well founded relations provide an intuitionistic notion of ordinals which admits transfinite induction. However these ordinals are not directed and their successor operation is poorly behaved, leading to problems of functoriality. We show how to make the successor monotone by introducing plumpness, which strengthens transitivity. This clarifies the traditional development of successors and unions, making it intuitionistic; even the (classical) proof of trichotomy is made simpler. The definition is, however, recursive, and, as their name suggests, the plump ordinals (...) grow very rapidly. Directedness must be defined hereditarily. It is orthogonal to the other four conditions, and the lower powerdomain construction is shown to be the universal way of imposing it. We treat ordinals as order-types, and develop a corresponding set theory similar to Osius' transitive set objects. This presents Mostowski's theorem as a reflection of categories, and set-theoretic union is a corollary of the adjoint functor theorem. Mostowski's theorem and the rank for some of the notions of ordinal are formulated and proved without the axiom of replacement, but this seems to be unavoidable for the plump rank. The comparison between sets and toposes is developed as far as the identification of replacement with completeness, and there are some suggestions for further work in this area. Each notion of set or ordinal defines a free algebra for one of the theories discussed by Joyal and Moerdijk, namely joins of a family of arities together with an operation s satisfying conditions such as x ≤ sx, monotonicity or s(x ∨ y) ≤ sx ∨ sy. Finally we discuss the fixed point theorem for a monotone endofunction s of a poset with least element and directed joins. This may be proved under each of a variety of additional hypotheses. We explain why it is unlikely that any notion of ordinal obeying the induction scheme for arbitrary predicates will prove the pure result. (shrink)

Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...) potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. (shrink)

The origin of paraconsistent logic is closely related with the argument, ‘from the assertion of two mutually contradictory statements any other statement can be deduced’; this can be referred to as ex contradictione sequitur quodlibet (ECSQ). Despite its medieval origin, only by the 1930s did it become the main reason for the unfeasibility of having contradictions in a deductive system. The purpose of this article is to study what happened earlier: from Principia Mathematica to that time, when it became well (...) established. The two main historical claims that I am going to advance are the following: (1) the first explicit use of ECSQ as the main argument for supporting the necessity of excluding any contradiction from deductive systems is to be found in the first edition of the book Grundzüge der Theoretischen Logik (Hilbert, D. and Ackermann, W. 1928. Grundzüge der Theoretischen Logik. Berlin: Julius Springer Verlag); (2) Łukasiewicz's position regarding the logical constraints against contradictions varies considerably from his studies on the principle of (non-) contradiction in Aristotle, published in 1910 and what is stated in his `authorized lectured notes' on mathematical logic that appeared in 1929. The two texts are: 1) a paper in German (Łukasiewicz, J. 1910. `Über den Satz des Widerspruchs bei Aristotles'. Bulletin International de l'Académie des sciences de Cracovie, Classe d'Histoire et de Philosophie, pp. 15–38) [English translation: Łukasiewicz, J. 1971. ‘On the principle of contradiction in Aristotle’, Review of Metaphysics, XXIV, 485–509]; and 2) a book in Polish. Łukasiewicz, J. 1910. O zasadzie sprzecznosci u Aristotelesa Studium krytyczne, Warsaw: Panstwowe Wydawnictwo Naukowe [German translation: Łukasiewicz, J. 1993. Über den Satz des Widerspruchs bei Aristotles. Hildesheim: Georg Olms Verlag]. The lecture notes were then published as a book (Łukasiewicz, J. 1958. Elementy Logiki Matematycznej. Warszawa: Panstwowe Wydawnictwo Naukowe [PWN] and then translated into English (Łukasiewicz, J. 1963. Elements of Mathematical Logic. Oxford, New York: Pergamon Press/the Macmillan Company). The second half of this article will concentrate on Łukasiewicz's position on ECSQ. This will lead me to propose that to regard him as a forerunner of paraconsistent logic by virtue of those early writings is accurate only if his book published in Polish is considered but not if the analysis is restricted to the paper originally published in German (as has been the case for the principal reconstructions of the history of paraconsistent logic). Furthermore, I will stress that in the 1929 book he presented one formalization of ECSQ as an axiom for sentential calculus and, also, he used ECSQ to defend the necessity of consistency, apparently independently of Hilbert and Ackermann's book. At the end, I will suggest that the aim of twentieth century usage of ECSQ was to change from the centuries-long philosophical discussion about contradictions to a more ‘technical’ one. But with paraconsistent logic viewed as a technical solution to this restriction, then, the philosophical problem revives but having now at one's disposal an improved understanding of it. Finally, Łukasiewicz's two different positions about ECSQ open an interesting question about the history of paraconsistent logic: do we have to attempt a consistent reconstruction of it, or are we prepared to admit inconsistencies within it? (shrink)

§§3-4 of the Begriffsschrift present Frege’s objections to a dominant if murky nineteenth-century semantic picture. I sketch a minimalist variant of the pre-Fregean picture which escapes Frege’s criticisms by positing a thin notion of semantic content which then interacts with a multiplicity of kinds of truth to account for phenomena such as modality. After exploring several ways in which we can understand the existence of multiple truth properties, I discuss the roles of pointwise and setwise truth properties in modal logic. (...) I argue that thinking of supertruth and determinate truth as setwise truth properties allows an understanding of supervaluationist approaches to vagueness which escapes both Williamson’s objections to and a needless metalinguistic orientation of traditional supervaluationism. (shrink)

This thesis is on the history and philosophy of logic and semantics. Logic can be described as the ‘science of reasoning’, as it deals primarily with correct patterns of reasoning. However, logic as a discipline has undergone dramatic changes in the last two centuries: while for ancient and medieval philosophers it belonged essentially to the realm of language studies, it has currently become a sub-branch of mathematics. This thesis attempts to establish a dialogue between the modern and the medieval traditions (...) in logic, by means of ‘translations’ of the medieval logical theories into the modern framework of symbolic logic, i.e. formalizations. One of its conclusions is that, when properly understood within their own framework, the interest of medieval logical theories for modern investigations go beyond mere historical interest, but that a thorough conceptual analysis of such theories must be undertaken in order to avoid conceptual misprojections. While such translations of medieval into modern logic have been attempted before, the approach presented here is innovative in that attention is paid to the similarities as well as to the dissimilarities between the two traditions, and to what can be learned from the medieval masters for modern investigations in logic and semantics. (shrink)

This thesis comprises three main chapters—each comprising one relatively standalone paper. The unifying theme is fragmentalism about truth, which is the view that the predicate “true” either expresses distinct concepts or expresses distinct properties. -/- In Chapter 1, I provide a formal development of alethic pluralism. Pluralism is the view that there are distinct truth properties associated with distinct domains of subject matter, where a truth property satisfies certain truth-characterizing principles. On behalf of pluralists, I propose an account of logic (...) and semantics that shows how they can answer central conceptual and logical challenges for their view. -/- In Chapter 2, I motivate and develop a modal account of propositions on the basis of an iterative conception of propositions, where the modality is logico-mathematical. The modal account of propositions takes the conception to motivate an inherently potential hierarchy of propositions. I show that the account helps provide satisfying solutions to the intensional paradoxes of Russell-Myhill, Kaplan, and Prior. -/- In Chapter 3, I propose that “true” is polysemous. I suggest that “true” is initially polysemous between correspondence truth and disquotational truth, and further polysemous between the meanings corresponding to the subconcepts of the concept truth generated by the indefinite extensibility of that concept. I show that the proposal provides satisfying solutions to the semantic paradoxes. (shrink)

The game of life is an excellent framework for metaphysical modeling. It can be used to study ontological categories like space, time, causality, persistence, substance, emergence, and supervenience. It is often said that there are many levels of existence in the game of life. Objects like the glider are said to exist on higher levels. Our goal here is to work out a precise formalization of the thesis that there are various levels of existence in the game of life. To (...) formalize this thesis, we develop a set-theoretic construction of the glider. The method of this construction generalizes to other patterns in the game of life. And it can be extended to more realistic physical systems. The result is a highly general method for the set-theoretical construction of substances. (shrink)