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...

Formalism in the philosophy of mathematics has taken a variety of forms and has been advocated for widely divergent reasons. In Sects. 1 and 2, I briefly introduce the major formalist doctrines of the late nineteenth and early twentieth centuries. These are what I call empirico-semantic formalism, game formalism and instrumental formalism. After describing these views, I note some basic points of similarity and difference between them. In the remainder of the paper, I turn my attention to Hilbert’s instrumental formalism. (...) My primary aim there will be to develop its formalist elements more fully. These are, in the main, its rejection of the axiom-centric focus of traditional model-construction approaches to consistency problems, its departure from the traditional understanding of the basic nature of proof and its distinctively descriptive or observational orientation with regard to the consistency problem for arithmetic. More specifically, I will highlight what I see as the salient points of connection between Hilbert’s formalist attitude and his finitist standard for the consistency proof for arithmetic. I will also note what I see as a significant tension between Hilbert’s observational approach to the consistency problem for arithmetic and his expressed hope that his solution of that problem would dispense with certain epistemological concerns regarding arithmetic once and for all. (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)

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)

We present a manuscript of Paul Lorenzen that provides a proof of consistency for elementary number theory as an application of the construction of the free countably complete pseudocomplemented semilattice over a preordered set. This manuscript rests in the Oskar-Becker-Nachlass at the Philosophisches Archiv of Universität Konstanz, file OB 5-3b-5. It has probably been written between March and May 1944. We also compare this proof to Gentzen's and Novikov's, and provide a translation of the manuscript.

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

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)

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)

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.

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

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.

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.

In his 1896 lecture course on logic–reportedly a blueprint for the Prolegomena to Pure Logic –Husserl develops an explicit account of logic as an independent and purely theoretical discipline. According to Husserl, such a theory is needed for the foundations of logic (in a more general sense) to avoid psychologism in logic. The present paper shows that Husserl’s conception of logic (in a strict sense) belongs to the algebra of logic tradition. Husserl’s conception is modeled after arithmetic, and respectively logical (...) inferences are viewed as analogical to arithmetical calculation. The paper ends with an examination of Husserl’s involvement with the key characters of the algebra of logic tradition. It is concluded that Ernst Schröder, but presumably also Hermann and Robert Grassmann influenced Husserl most in his turn away from psychologism. (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.

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)

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)

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)

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)

The formalist philosophy of mathematics (in its purest, most extreme version) is widely regarded as a “discredited position”. This pure and extreme version of formalism is called by some authors “game formalism”, because it is alleged to represent mathematics as a meaningless game with strings of symbols. Nevertheless, I would like to draw attention to some arguments in favour of game formalism as an appropriate philosophy of real mathematics. For the most part, these arguments have not yet been used or (...) were neglected in past discussions. (shrink)

Gödel always claimed that he did not know Skolem's Helsinki lecture when writing his dissertation. Some questions and doubts have been raised about this claim, in particular on the basis of a library slip showing that he had requested Skolem's paper in 1928. It is shown that this library slip does not constitute evidence against Gödel's claim, and that, on the contrary, the library slip and other archive material actually corroborate what Gödel said.

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)

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)

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)

Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...) developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic. (shrink)

In the pages that follow, it is our intention to present a panoramic and schematic view of the evolution of the formalist program, which derives from recent studies of lecture notes that were unknown until very recently. Firstly, we analyze certain elements of the program. Secondly, we observe how, once the program was established in 1920, in the period up to 1931, different types of finitism with a common basis were tried out by Hilbert and Bernays, in an effort to (...) define their program precisely and bring it successfully to fruition. The result is a complex research program in constant evolution. (shrink)

Putnam’s model-theoretic arguments for the indeterminacy of reference have been taken to pose a special problem for mathematical languages. In this paper, I argue that if one accepts that there are theory-external constraints on the reference of at least some expressions of ordinary language, then Putnam’s model-theoretic arguments for mathematical languages don’t go through. In particular, I argue for a kind of descriptivism about mathematical expressions according to which their reference is “anchored” in the reference of expressions of ordinary language. (...) These anchors add enough to the content of mathematical expressions to forestall the radical kind of indeterminacy that model-theoretic arguments are purported to show, while still leaving room for a plausible, moderate kind of indeterminacy. (shrink)

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)

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)

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)

§§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 volume will be of particular interest to researchers working in the history, and in the philosophy, of logic and mathematics, and more generally, to ...

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)

The formalism of mathematics has always inspired ontological theorization based on it. As is evident from his magnum opus Being and Event, Alain Badiou remains one of the most important contemporary contributors to this enterprise. His famous maxim—“mathematics is ontology” has its basis in the ingenuity that he has shown in capitalizing on Gödel’s and Cohen’s work in the field of set theory. Their work jointly establish the independence of the continuum hypothesis from the standard axioms of Zermelo–Fraenkel set theory, (...) with Gödel’s result showing their consistency to the affirmative, while Cohen’s showing it to the negative. These results serve as the cornerstone of Badiou’s mathematical ontology. In it, drawing heavily on Cohen’s technically formidable method of forcing, Badiou makes the latter result the key to his defense of the possibility of a faithful tracing of the consequences in the ‘state’ of an ‘event’ by a ‘subject’. Whereas, Gödel’s result based on the assumption of constructability becomes the pivot for criticism of the general philosophical orientation that Badiou calls ‘constructivism’. Viewed from a position internal to mathematical formalism itself, and taking into account the twentieth century developments in the relevant field, Badiou’s stance seems to be neither appreciative of the actual course of such developments, nor just to the philosophical view point that was actually maintained by Gödel. In the present paper, this concern is intended to be substantiated through an exposition of certain facts pertaining to the said developments as well as to Gödel’s philosophical inclinations. (shrink)

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)

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...

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.

This paper offers a unification and systematization of the grounding approaches to truth, denotation, classes and abstraction. Its main innovation is a method for “kleenifying” bivalent semantics so as to ensure that the trivalent semantics used for various linguistic elements are perfectly analogous to the semantics used by Kripke, rather than relying on intuition to achieve similarity. The focus is on generalizing strong Kleene semantics, but one section is devoted to supervaluation, and the unification method also extends to weak Kleene (...) semantics. (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)

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)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

What particular privilege has this little Agitation of the Brain which we call Thought, that we must make it the Model of the whole Universe? (Hume, Dialogues Concerning Natural Religion, 1976, p. 168)******...at once it struck me, what quality went to form a Man (sic) of Achievement especially in Literature and which Shakespeare possessed so enormously—I mean Negative Capability, that is when someone is capable of being in uncertainties, Mysteries, doubts without any irritable reaching after fact and reason. (Keats 1959, (...) p. 261)******Die menschliche Vernunft hat das besondere Schicksal in ihrer Gattung ihrer Erkenntnisse: dass sie durch Fragen belästigt wird, die sie nicht abweisen kann; denn sie sind ihr durch die Natur der Vernunft selbst aufgegeben, die sie aber auch nicht beantworten kann; denn sie übersteigen alles Vermögen der menschlichen Vernunft. (Opening lines of the Kritik der reinen Vernunft (1956), A VII; the italics in the text are mine)Human reason has the particular fa .. (shrink)

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)