This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks (...) are of no help in explaining arithmetical determinacy. (shrink)

In certain philosophical quarters, a new metaphilosophical position is being discussed—antiphilosophy. Such a position seems to maintain that there is no distinction between philosophy and sophistry, reason and rhetoric, arguing and emoting. This paper examines antiphilosophy. Specifically, it aims to address three interrelated questions: Is antiphilosophy a possible metaphilosophical position? If it is, what characterizes it? And what ramifications would it have? The paper argues that antiphilosophy is possible and is best construed as an attempt to reconstruct philosophical discourse on (...) noncognitive lines. Explicitly, “to assert” and the belief propositional attitude is replaced by “to convince” and a pro‐attitude desire to rhetorically talk someone into something. The paper examines one possible form such a position could take as well as various ramifications of it. (shrink)

Resumen:En este artículo delineamos una propuesta para elaborar una lógica de las ficciones desde el enfoque lúdico del pragmatismo dialógico. En efecto, centrados en una de las críticas mayores al enfoque clásico de la lógica: la esquizofrenia estructural de su semántica (Lambert 2004: 142-143; 160), recorremos los compromisos ontológicos de las dos tradiciones mayores de la lógica (Aristóteles y Frege) para establecer sus posibilidades y límites en el análisis del discurso ficcional, y la superación desde una perspectiva lúdico pragmática.Palabras clave: (...) lógica; dialógica; cuadro de oposición; esquizofrenia; semántica lúdica; cuantificador existencial; nombres propios; intuicionismo; tercero excluido; doble negación; ficciones. (shrink)

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

Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...) como questões acerca das conexões destes com a realidade não mental e extralinguística. A razão daquela qualificação é a seguinte: por um lado, a investigação em questão é qualificada como filosófica em virtude do elevado grau de generalidade e abstracção das questões examinadas (entre outras coisas); por outro, a investigação é qualificada como lógica em virtude de ser uma investigação logicamente disciplinada, no sentido de nela se fazer um uso intenso de conceitos, técnicas e métodos provenientes da disciplina de lógica. O agregado de tópicos que constitui a área de estudos lógico-filosóficos é já visível, pelo menos em parte, no Tractatus Logico-Philosophicus de Ludwig Wittgenstein, uma obra publicada em 1921. E uma boa maneira de ter uma ideia sinóptica do território disciplinar abrangido por esta enciclopédia, ou pelo menos de uma porção substancial dele, é extrair do Tractatus uma lista dos tópicos mais salientes aí discutidos; a lista incluirá certamente tópicos do seguinte género, muitos dos quais se podem encontrar ao longo desta enciclopédia: factos e estados de coisas; objectos; representação; crenças e estados mentais; pensamentos; a proposição; nomes próprios; valores de verdade e bivalência; quantificação; funções de verdade; verdade lógica; identidade; tautologia; o raciocínio matemático; a natureza da inferência; o cepticismo e o solipsismo; a indução; as constantes lógicas; a negação; a forma lógica; as leis da ciência; o número. (shrink)

A semantic theory is committed to semantic monism just in case every particular semantic property posited by the theory is a member of the same kind. The commitment to semantic monism appears to draw some support from the need to provide a compositional semantics, since taking a single kind of semantic property as key to a semantic theory affords a uniform pattern on the basis of which the meaning of any given sentence can be compositionally determined. This line of support (...) highlights a tension between the principle of compositionality and taking a more pluralistic approach to semantic theorizing. In this essay, that tension is relieved, leaving open the prospect of a pluralistic semantic theory that observes the principle of compositionality. (shrink)

This is a survey of the concept of continuity. Efforts to explicate continuity have produced a plurality of philosophical conceptions of continuity that have provably distinct expressions within contemporary mathematics. I claim that there is a divide between the conceptions that treat the whole continuum as prior to its parts, and those conceptions that treat the parts of the continuum as prior to the whole. Along this divide, a tension emerges between those conceptions that favor philosophical idealizations of continuity and (...) those that are more readily available for mathematico-scientific use. (shrink)

This paper aims to contribute to the analysis of the nature of mathematical modality and hyperintensionality, and to the applications of the latter to absolute decidability. Rather than countenancing the interpretational type of mathematical modality as a primitive, I argue that the interpretational type of mathematical modality is a species of epistemic modality. I argue, then, that the framework of two-dimensional semantics ought to be applied to the mathematical setting. The framework permits of a formally precise account of the priority (...) and relation between epistemic mathematical modality and metaphysical mathematical modality. The discrepancy between the modal systems governing the parameters in the two-dimensional intensional setting provides an explanation of the difference between the metaphysical possibility of absolute decidability and our knowledge thereof. I also advance a topic-sensitive epistemic two-dimensional truthmaker semantics, if hyperintensional approaches are to be preferred to possible worlds semantics. I examine the relation between two-dimensional hyperintensional states and epistemic set theory, providing two-dimensional hyperintensional formalizations of the modal logic of ZFC, large cardinal axioms, $\Omega$-logic, and the Epistemic Church-Turing Thesis. (shrink)

In his paper “Explaining Deductive Inference” Prawitz states what he calls «a fundamental problem of logic and the philosophy of logic»: the problem of explaining «Why do certain inferences have the epistemic power to confer evidence on the conclusion when applied to premisses for which there is evidence already?». In this paper I suggest a way of articulating, and partly modifying, the intuitionistic answer to this problem in such a way as to both answer Prawitz’s problem and satisfy a requirement (...) I argue to be crucial for any epistemic theory of the meaning of the logical constants: the requirement that evidence is epistemically transparent. (shrink)

This paper discusses the philosophical and logical motivations for rejectivism, primarily by considering a dialogical approach to logic, which is formalized in a Question–Answer Semantics. We develop a generalized account of rejectivism through close consideration of Mark Textor's arguments against rejectivism that the negative expression ‘No’ is never used as an act of rejection and is equivalent with a negative sentence. In doing so, we also shed light upon well-known issues regarding the supposed non-embeddability and non-iterability of force indicators.

To what extent can constructive mathematics based on intuitionistc logic recover the mathematics needed for spacetime physics? Certain aspects of this important question are examined, both technical and philosophical. On the technical side, order, connectivity, and extremization properties of the continuum are reviewed, and attention is called to certain striking results concerning causal structure in General Relativity Theory, in particular the singularity theorems of Hawking and Penrose. As they stand, these results appear to elude constructivization. On the philosophical side, it (...) is argued that any mentalist-based radical constructivism suffers from a kind of neo-Kantian apriorism. It would be at best a lucky accident if objective spacetime structure mirrored mentalist mathematics. the latter would seem implicitly committed to a Leibnizian relationist view of spacetime, but is it doubtful if implementation of such a view would overcome the objection. As a result, an anti-realist view of physics seems forced on the radical constructivist. (shrink)

According to the “paradox of knowability”, the moderate thesis that all truths are knowable – ... – implies the seemingly preposterous claim that all truths are actually known – ... –, i.e. that we are omniscient. If Fitch’s argument were successful, it would amount to a knockdown rebuttal of anti-realism by reductio. In the paper I defend the nowadays rather neglected strategy of intuitionistic revisionism. Employing only intuitionistically acceptable rules of inference, the conclusion of the argument is, firstly, not ..., (...) but .... Secondly, even if there were an intuitionistically acceptable proof of ..., i.e. an argument based on a different set of premises, the conclusion would have to be interpreted in accordance with Heyting semantics, and read in this way, the apparently preposterous conclusion would be true on conceptual grounds and acceptable even from a realist point of view. Fitch’s argument, understood as an immanent critique of verificationism, fails because in a debate dealing with the justification of deduction there can be no interpreted formal language on which realists and anti-realists could agree. Thus, the underlying problem is that a satisfactory solution to the “problem of shared content” is not available. I conclude with some remarks on the proposals by J. Salerno and N. Tennant to reconstruct certain arguments in the debate on anti-realism by establishing aporias. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

Aristotle's General Definition of the Syllogism may be taken as consisting of two parts: the Inferential Conditions and the Final Clause. Although this distinction is well known, traditional interpretations neglect the Final Clause and its influence on syllogistic. Instead, the aforementioned tradition focuses on the Inferential Conditions only. We intend to show that this neglect has severe consequences not just on syllogistic but on the whole exegesis of Aristotle's Prior Analytics I. Due to these consequences, our objective is to analyse (...) the General Definition's Final Clause and its consequences on syllogistic. We propose a reading of the Final Clause as an additional criterion for distinguishing some arguments as properly syllogistic ones and as a main theme which connects all parts of the Prior Analytics I into one coherent piece of work. (shrink)

The logic of justification provides an in-depth analysis of the epistemic states of an agent. This paper aims at solving some of the problems to which the common interpretation of the operators of justification logic is subject by providing a framework in which a crucial distinction between potential and explicit justifiers is exploited. The paper is subdivided into three sections. The first section offers an introduction to a basic system LJ of justification logic and to the problems concerning its interpretation. (...) In the second section, three new systems of justification logic are introduced and characterised with respect to an appropriate semantics. The final section shows why the highlighted problems do not afflict the new systems and how it is possible to interpret LJ in the new framework. (shrink)

‘Reasoning’ can be considered a general concept that, upon speaking, is the ‘enraonar’, a Catalan word that should not be mistaken with ‘explain’ nor with ‘discuss’ which imply more detail, and cover different situations. This article is presented as an essay on the ancient ideal of ‘enraonar’. To that end, it is explained in what sense ‘enraonar’ and reason are one of the most complex phenomena thought has to deal with. Here it is argued that these natural phenomena require a (...) systematic and ‘scientific’ study, and that withoutthis knowledge computer science cannot simulate people’s every-day ‘enraonar’. (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)

In this essay, the tension that Benacerraf identifies for theories of mathematical truth is used as the vehicle for arguing against a particular desideratum for semantic theories. More specifically, I place in question the desideratum that a semantic theory, provided for some area of discourse, should run in parallel with the semantic theory holding for the rest of the language. The importance of this desideratum is also made clear by means of tracing out the subtle implications of its rejection.

The catuṣkoṭi or tetralemma is an argumentative figure familiar to any reader of Buddhist philosophical literature. Roughly speaking it consists of the enumeration of four alternatives: that some propositions holds, that it fails to hold, that it both holds and fails to hold, that it neither holds nor fails to hold. The tetralemma also constitutes one of the more puzzling features of Buddhist philosophy as the use to which it is put in arguments is not immediately obvious and certainly not (...) uniform: sometimes one of the four possibilities is selected as ‘the right one’, sometimes all four are rejected, sometimes all four are affirmed. It seems that this confusion is only exacerbated by the plethora of treatments we find in the modern commentarial literature, many of which try to analyze the tetralemma by recourse to notions of modern logic. Despite some important work done during the last decades a comprehensive study of the origin and development of the catuṣkoṭi from its use in the earliest Buddhist literature up to its later employment in the Buddhist philosophical works of Tibet, China, and Japan remains yet to be written. The present paper is obviously not intended to fill this gap, but has the specific objective of giving an interpretation of Nāgārrjuna’s employment of the tetralemma which makes both logical sense and is in accordance with his general philosophical position. (shrink)

In this paper we obtain a finite Hilbert-style axiomatization of the implicationless fragment of the intuitionistic propositional calculus. As a consequence we obtain finite axiomatizations of all structural closure operators on the algebra of {–}-formulas containing this fragment.

This paper defends the thesis that counterfactuals are strict conditionals. Its purpose is to show that there is a coherent view according to which counterfactuals are strict conditionals whose antecedent is stated elliptically. Section 1 introduces the view. Section 2 outlines a response to the main argument against the thesis that counterfactuals are strict conditionals. Section 3 compares the view with a proposal due to Aqvist, which may be regarded as its direct predecessor. Sections 4 and 5 explain how the (...) view di ers from the theories of counterfactuals advocated by Stalnaker and Lewis, and from some contextualist strict conditional accounts of counterfactuals that have emerged recently. Finally, section 6 addresses the thorny issue of disjunctive antecedents. (shrink)

This paper offers a new interpretation for Wittgenstein`s treatment of mathematical identities. As it is widely known, Wittgenstein`s mature philosophy of mathematics includes a general rejection of abstract objects. On the other hand, the traditional interpretation of mathematical identities involves precisely the idea of a single abstract object – usually a number –named by both sides of an equation.

Inferentialism is the conviction that to be meaningful in the distinctively human way, or to have a 'conceptual content', is to be governed by a certain kind of inferential rules. The term was coined by Robert Brandom as a label for his theory of language; however, it is also naturally applicable (and is growing increasingly common) within the philosophy of logic.

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)

It is sometimes held that rules of inference determine the meaning of the logical constants: the meaning of, say, conjunction is fully determined by either its introduction or its elimination rules, or both; similarly for the other connectives. In a recent paper, Panu Raatikainen argues that this view—call it logical inferentialism—is undermined by some “very little known” considerations by Carnap (1943) to the effect that “in a definite sense, it is not true that the standard rules of inference” themselves suffice (...) to “determine the meanings of [the] logical constants” (p. 2). In a nutshell, Carnap showed that the rules allow for non-normal interpretations of negation and disjunction. Raatikainen concludes that “no ordinary formalization of logic [... ] is sufficient to ‘fully formalize’ all the essential properties of the logical constants” (ibid.). We suggest that this is a mistake. Pace Raatikainen, intuitionists like Dummett and Prawitz need not worry about Carnap’s problem. And although bilateral solutions for classical inferentialists—as proposed by Timothy Smiley and Ian Rumfitt—seem inadequate, it is not excluded that classical inferentialists may be in a position to address the problem too. (shrink)

In this paper, I consider an argument for the claim that any satisfactory epistemology of mathematics will violate core tenets of naturalism, i.e. that mathematics cannot be naturalized. I find little reason for optimism that the argument can be effectively answered.

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...) and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

Intuitionism’s disagreement with classical logic is standardly based on its specific understanding of truth. But different intuitionists have actually explicated the notion of truth in fundamentally different ways. These are considered systematically and separately, and evaluated critically. It is argued that each account faces difficult problems. They all either have implausible consequences or are viciously circular.

Can an epistemic conception of truth and an endorsement of the excluded middle (together with other principles of classical logic abandoned by the intuitionists) cohabit in a plausible philosophical view? In PART I I describe the general problem concerning the relation between the epistemic conception of truth and the principle of excluded middle. In PART II I give a historical overview of different attitudes regarding the problem. In PART III I sketch a possible holistic solution.

Should weak forms of the axiom of choice really be accepted within constructive mathematics? A critical view of the Brouwer-Heyting-Kolmogorov interpretation, accompanied by the intention to include nondeterministic algorithms, leads us to subscribe to Richman's appeal for dropping countable choice. As an alternative interpretation of intuitionistic logic, we propose to renew dialogue semantics.

This essay presents a long, detailed, in many ways critical but also appreciative account, of David Bloor’s recent book The Enigma of the Aerofoil. I take that work as the crowning statement of ideas and principles developed over the past four decades by Bloor and other exponents of the ‘strong programme’ in the sociology of scientific knowledge. It therefore offers both a test-case of that approach and a welcome opportunity to review, clarify and extend some of the arguments brought against (...) it by critical realists. This purpose is particularly well served by Bloor’s having here assembled such a wealth of scientific, historical, political and socio-cultural data concerning one specific, very crucial period of research into theories of aerodynamic lift. His book thus provides an exceptionally useful point of engagement for anyone seeking to adjudicate these issues from a critically angled but engaged and constructive standpoint. (shrink)

Straightforwardly and strictly intuitionistic inferences show that the Brouwer– Heyting–Kolmogorov interpretation, in the presence of a formulation of the recognition principle, entails the validity of the Law of Testability: that the form ¬ f V ¬¬ f is valid. Therefore, the BHK and recognition, as described here, are inconsistent with the axioms both of intuitionistic mathematics and of Markovian constructivism. This finding also implies that, if the BHK and recognition are suitably formulated, then Brouwer’s original weak counterexample reasoning was fallacious. (...) The results of the present article extend and refine those of McCarty, C.. Antirealism and Constructivism: Brouwer’s Weak Counterexamples. The Review of Symbolic Logic. First View. Cambridge University Press. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter \textbf{2} argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. Elohim develops a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter \textbf{3} provides an abstraction principle for epistemic (hyper-)intensions. Chapter \textbf{4} advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter \textbf{5} applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal $\mu$-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal $\mu$-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter \textbf{6} advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter \textbf{7} provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters \textbf{2} and \textbf{4} are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters \textbf{8-12} provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter \textbf{8} examines the interaction between Elohim's hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of $\Omega$-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter \textbf{9} examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. Elohim countenances a hyperintensional semantics for novel epistemic abstractionist modalities. Elohim suggests, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter \textbf{10} examines the philosophical significance of hyperintensional $\Omega$-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter \textbf{11} provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter \textbf{12} avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. Elohim invents a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter \textbf{13} examines modal responses to the alethic paradoxes. Elohim provides a counter-example to epistemic closure for logical deduction. Chapter \textbf{14} examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

A logical constant is weakly disharmonious if its elimination rules are weaker than its introduction rules. Substructural weak disharmony is the weak disharmony generated by structural restrictions on the eliminations. I argue that substructural weak disharmony is not a defect of the constants which exhibit it. To the extent that it is problematic, it calls into question the structural properties of the derivability relation. This prompts us to rethink the issue of controlling the structural properties of a logic by means (...) of harmony. I argue that such a control is possible and desirable. Moreover, it is best achieved by global tests of harmony. (shrink)

We construct an extension P of the standard language of classical propositional logic by adjoining to the alphabet of a new category of logical-pragmatic signs. The well formed formulas of are calledradical formulas (rfs) of P;rfs preceded by theassertion sign constituteelementary assertive formulas of P, which can be connected together by means of thepragmatic connectives N, K, A, C, E, so as to obtain the set of all theassertive formulas (afs). Everyrf of P is endowed with atruth value defined classically, (...) and everyaf is endowed with ajustification value, defined in terms of the intuitive notion of proof and depending on the truth values of its radical subformulas. In this framework, we define the notion ofpragmatic validity in P and yield a list of criteria of pragmatic validity which hold under the assumption that only classical metalinguistic procedures of proof be accepted. We translate the classical propositional calculus (CPC) and the intuitionistic propositional calculus (IPC) into the assertive part of P and show that this translation allows us to interpret Intuitionistic Logic as an axiomatic theory of the constructive proof concept rather than an alternative to Classical Logic. Finally, we show that our framework provides a suitable background for discussing classical problems in the philosophy of logic. (shrink)

The ArgumentL. E. J. Brouwer and David Hubert, two titans of twentieth-century mathematics, clashed dramatically in the 1920s. Though they were both Kantian constructivists, their notoriousGrundlagenstreitcentered on sharp differences about the foundations of mathematics: Brouwer was prepared to revise the content and methods of mathematics (his “Intuitionism” did just that radically), while Hilbert's Program was designed to preserve and constructively secure all of classical mathematics.Hilbert's interests and polemics at the time led to at least three misconstruals of intuitionism, misconstruals which (...) last to our own time: Current literature often portrays popular views of intuitionism as the product of Brouwer's idiosyncratic subjectivism; modern logicians view intuitionism as simply applying a non-standard formal logic to mathematics; and contemporary philosophers see that logic as based upon a pure assertabilist theory of meaning. These pictures stem from the way Hilbert structured the controversy.Even though Brouwer's own work and behavior occasionally reinforce these pictures, they are nevertheless inaccurate accounts of his approach to mathematics. However, the framework provided by the Brouwer-Hilbert debate itself does not supply an adequate correction of these inaccuracies. For, even if we eliminate these mistakes within that framework, Brouwer's position would still appear fragmented and internally inconsistent. I propose a Kantian framework — not from Kant's philosophy of mathematics but from his general metaphysics — which does show the coherence and consistency of Brouwer's views. I also suggest that expanding the context of the controversy in this way will illuminate Hilbert's views as well and will even shed light upon Kant's philosophy. (shrink)

Expressivism’s central idea is that normative sentences bear the same relation to non-cognitive attitudes that ordinary descriptive sentences bear to beliefs: the expression relation. Allan Gibbard teIls us that “that words express judgments will be accepted by almost everyone” - the distinctive contribution of expressivism, his claim goes, is only a view about what kind of judgments words express. But not every account of the expression relation is equally suitable for the expressivist’s purposes. In fact, what I argue in this (...) paper, considering four possible accounts of expression, is that how suitable each account is for the expressivist’s purpose varies in proportion to how controversial it is. So Gibbard is wrong - if expression is to get expressivism off the ground, then it will be enormously controversial whether words do express judgments. And thus expressivism is committed to strong claims about the semantics of non-normative language. (shrink)

§1. The mission of axiomatic set theory. What is set theory needed for in the foundations of mathematics? Why cannot we transact whatever foundational business we have to transact in terms of our ordinary logic without resorting to set theory? There are many possible answers, but most of them are likely to be variations of the same theme. The core area of ordinary logic is by a fairly common consent the received first-order logic. Why cannot it take care of itself? (...) What is it that it cannot do? A large part of every answer is probably that first-order logic cannot handle its own model theory and other metatheory. For instance, a first-order language does not allow the codification of the most important semantical concept, viz. the notion of truth, for that language in that language itself, as shown already in Tarski. In view of such negative results it is generally thought that one of the most important missions of set theory is to provide the wherewithal for a model theory of logic. For instance Gregory H. Moore asserts in his encyclopedia article “Logic and set theory” thatSet theory influenced logic, both through its semantics, by expanding the possible models of various theories and by the formal definition of a model; and through its syntax, by allowing for logical languages in which formulas can be infinite in length or in which the number of symbols is uncountable. (shrink)

One kind of structuralism holds that mathematics is about structures, conceived as a type of abstract entity. Another denies that it is about any distinctively mathematical entities at all—even abstract structures; rather it gives purely general information about what holds of any collection of entities conforming to the axioms of the theory. Of these, pure structuralism is most plausibly taken to enjoy significant advantages over platonism. But in what appears to be its most plausible—modalised—version, even restricted to elementary arithmetic, it (...) requires defence of a very strong possibility claim: that there could be a completed w-sequence of concrete objects. There are very serious epistemological difficulties in the way of providing the requisite defence. (shrink)

This paper examines the problem of extending the programme of mathematical constructivism to applied mathematics. I am not concerned with the question of whether conventional mathematical physics makes essential use of the principle of excluded middle, but rather with the more fundamental question of whether the concept of physical infinity is constructively intelligible. I consider two kinds of physical infinity: a countably infinite constellation of stars and the infinitely divisible space-time continuum. I argue (contrary to Hellman) that these do not. (...) pose any insuperable problem for constructivism, and that constructivism may have a useful new perspective to offer on physics. (shrink)

Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ (...) problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof. (shrink)

This article offers an explanation of perhaps Wittgenstein’s strangest and least intuitive thesis – the semantical mutation thesis – according to which one can never answer a mathematical conjecture because the new proof alters the very meanings of the terms involved in the original question. Instead of basing our justification on the distinction between mere calculation and proofs of isolated propositions, characteristic of Wittgenstein’s intermediary period, we generalize it to include conjectures involving effective procedures as well.

Toulmin’s scheme for the layout of arguments (1958, The Uses of Argument, Cambridge University Press, Cambridge) represents an influential tool for the analysis of arguments. The scheme enriches the traditional premises-conclusion model of arguments by distinguishing additional elements, like warrant, backing and rebuttal. The present paper contains a formal elaboration of Toulmin’s scheme, and extends it with a treatment of the formal evaluation of Toulmin-style arguments, which Toulmin did not discuss at all. Arguments are evaluated in terms of a so-called (...) dialectical interpretation of their assumptions. In such an interpretation, an argument’s assumptions can be evaluated as defeated, e.g., when there is a defeating reason against the assumption. The present work builds on recent research on defeasible argumentation (cf. e.g. the work of Pollock, Reiter, Loui, Vreeswijk, Prakken, Hage and Dung). More specifically, the author’s work on the dialectical logic DEFLOG and the argumentation tool ARGUMED serve as starting points. (shrink)

We build on an existing a term-sequent logic for the λ-calculus. We formulate a general sequent system that fully integrates αβη-reductions between untyped λ-terms into first order logic. We prove a cut-elimination result and then offer an application of cut-elimination by giving a notion of uniform proof for λ-terms. We suggest how this allows us to view the calculus of untyped αβ-reductions as a logic programming language (as well as a functional programming language, as it is traditionally seen).

We first consider the entailment logic MC, based on meaning containment, which contains neither the Law of Excluded Middle (LEM) nor the Disjunctive Syllogism (DS). We then argue that the DS may be assumed at least on a similar basis as the assumption of the LEM, which is then justified over a finite domain or for a recursive property over an infinite domain. In the latter case, use is made of Mathematical Induction. We then show that an instance of the (...) LEM is intrumental in the proof of Cantor's Theorem, and we then argue that this is based on a more general form than can be reasonably justified. We briefly consider the impact of our approach on arithmetic and naive set theory, and compare it with intuitionist mathematics and briefly with recursive mathematics. Our "Four Basic Logical Issues" paper would provide useful background, the current paper being an application of the some of the ideas in it. (shrink)