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)

Constructivist epistemology posits that all truths are knowable. One might ask to what extent constructivism is compatible with naturalized epistemology and knowledge obtained from inference-making using successful scientific theories. If quantum theory correctly describes the structure of the physical world, and if quantum theoretic inferences about which measurement outcomes will be observed with unit probability count as knowledge, we demonstrate that constructivism cannot be upheld. Our derivation is compatible with both intuitionistic and quantum propositional logic. This result is implied by (...) the Frauchiger-Renner theorem, though it is of independent importance as well. (shrink)

Immanuel Kant states that indirect arguments are not suitable for the purposes of transcendental philosophy. If he is correct, this affects contemporary versions of transcendental arguments which are often used as an indirect refutation of scepticism. I discuss two reasons for Kant’s rejection of indirect arguments. Firstly, Kant argues that we are prone to misapply the law of excluded middle in philosophical contexts. Secondly, Kant points out that indirect arguments lack some explanatory power. They can show that something is true (...) but they do not provide insight into why something is true. Using mathematical proofs as examples, I show that this is because indirect arguments are non-constructive. From a Kantian point of view, transcendental arguments need to be constructive in some way. In the last part of the paper, I briefly examine a comment made by P. F. Strawson. In my view, this comment also points toward a connection between transcendental and constructive reasoning. (shrink)

In one of his meetings with members of the Vienna Circle, Wittgenstein discusses Hermann Weyl’s brief conversion to intuitionism and criticizes his arguments against applying the law of the excluded middle to generalizations over the natural numbers. Like Weyl, however, Wittgenstein rejects the classical model theoretic conception of generality when it comes to infinite domains. Nonetheless, he disagrees with him about the reasons for doing so. This paper provides an account of Wittgenstein’s criticism of Weyl that is based on his (...) differing understanding of what a general statement over infinite domains consists in. This difference in their conception of generality is argued to be central to the middle Wittgenstein’s overall stance on intuitionism as well. While Weyl (and other intuitionists) reject the law of the excluded middle on grounds of constructivity, Wittgenstein argues that general statements over infinite domains do not express propositions in the first place. The origin of this position as well as its consequences for contemporary debates on generality are further assessed. (shrink)

A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...) In this paper we tackle this expressive issue. We assume some background sentential language as given and define what we call an inferential language, that is, a language whose atomic formulas are inferences. We provide a model-theoretic characterization of validity for this language—relative to some given characterization of validity for the background sentential language—and provide a proof-theoretic analysis of validity. We argue that our novel language has fruitful philosophical applications. Lastly, we generalize some of our definitions and results to arbitrary metainferential levels. (shrink)

The main research goal of the work is to study the notion of co-topos, its correctness, properties and relations with toposes. In particular, the dualization process proposed by proponents of co-toposes has been analyzed, which transforms certain Heyting algebras of toposes into co-Heyting ones, by which a kind of paraconsistent logic may appear in place of intuitionistic logic. It has been shown that if certain two definitions of topos are to be equivalent, then in one of them, in the context (...) of a subobject classifier, there should be a neutral label for the generic subobject, or if the label "true" appears instead, it carries no additional properties or assumptions. It has been shown that a natural isomorphism occurring in one of the definitions of topos need not be an isomorphism of the corresponding algebraic structures on the sets, so that a co-Heyting algebraic structure can be defined on the set of characteristic morphisms, which moreover will also be natural. The analyzes suggest that the notion of co-topos may be considered correct. However, it should be strongly emphasized that although the possibility of defining the notion of co-topos has been shown, its further full consequences should be very carefully examined, which can severely limit its logical applications. (shrink)

An old and well-known objection to non-classical logics is that they are too weak; in particular, they cannot prove a number of important mathematical results. A promising strategy to deal with this objection consists in proving so-called recapture results. Roughly, these results show that classical logic can be used in mathematics and other unproblematic contexts. However, the strategy faces some potential problems. First, typical recapture results are formulated in a purely logical language, and do not generalize nicely to languages containing (...) the kind of vocabulary that usually motivates non-classical theories—for example, a language containing a naïve truth predicate. Second, proofs of recapture results typically employ classical principles that are not valid in the targeted non-classical system; hence, non-classical theorists do not seem entitled to those results. In this paper, we analyze these problems and provide solutions on behalf of non-classical theorists. To address the first problem, we provide a novel kind of recapture result, which generalizes nicely to a truth-theoretic language. As for the second problem, we argue that it relies on an ambiguity and that, once the ambiguity is removed, there are no reasons to think that non-classical logicians are not entitled to their recapture results. (shrink)

The semantic inferentialist account of the social institution of semantic meaning can be naturally extended to account for social ontology. I argue here that semantic inferentialism provides a framework within which mathematical ontology can be understood as social ontology, and mathematical facts as socially instituted facts. I argue further that the semantic inferentialist framework provides resources to underpin at least some aspects of the objectivity of mathematics, even when the truth of mathematical claims is understood as socially instituted.

Pluralist mathematical realism, the view that there exists more than one mathematical universe, has become an influential position in the philosophy of mathematics. I argue that, if mathematical pluralism is true (and we have good reason to believe that it is), then mathematical realism cannot (easily) be justified by arguments from the indispensability of mathematics to science. This is because any justificatory chain of inferences from mathematical applications in science to the total body of mathematical theorems can cover at most (...) one mathematical universe. Indispensability arguments may thus lose their central role in the debate about mathematical ontology. (shrink)

Mark Jago argues for truthmaker maximalism in some recent papers based on a key premise: that every truth could have a truthmaker. Jago contends that many would pretheoretically accept this principle and that counterexamples to it would be difficult to find. In this note, I show how truthmaker non-maximalists can use a modified version of Peter Milne's argument against maximalism to provide a counterexample to this key premise.

The historical consensus is that logical evidence is special. Whereas empirical evidence is used to support theories within both the natural and social sciences, logic answers solely to a priori evidence. Further, unlike other areas of research that rely upon a priori evidence, such as mathematics, logical evidence is basic. While we can assume the validity of certain inferences in order to establish truths within mathematics and test scientifi c theories, logicians cannot use results from mathematics or the empirical sciences (...) without seemingly begging the question. Appeals to rational intuition and analyticity in order to account for logical knowledge are symptomatic of these commitments to the apriority and basicness of logical evidence. This chapter argues that these historically prevalent accounts of logical evidence are mistaken, and that if we take logical practice seriously we fi nd that logical evidence is rather unexceptional, sharing many similarities to the types of evidence appealed to within other research areas. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

Logic is about reasoning, or so the story goes. This thesis looks at the concept of logic, what it is, and what claims of correctness of logics amount to. The concept of logic is not a settled matter, and has not been throughout the history of it as a notion. Tools from conceptual analysis aid in this historical venture. Once the unsettledness of logic is established we see the repercussions in current debates in the philosophy of logic. Much of the (...) battle over the ‘one true logic’ is conceptually talking past each other. The theory of logics-as-formalizations is presented as a conceptually open theory of logic which is Carnapian in flavour and grounding. Rudolf Carnap’s notions surrounding ‘external’ and ‘pseudo-questions’ about linguistic frameworks apply to formalizations, thus logics, as well. An account of what formalizations are, a more structured sub-set of modelling, is given to ground the claim that logics are formalizations. Finally, a novel account of correctness, the COFE framework, is developed which allows the notions of logical monism, pluralism and nihilism to be more precisely formulated than they currently are in the discourse. (shrink)

The traditional analysis of the basic version of the double-slit experiment leads to the conclusion that wave-particle duality is a fundamental fact of nature. However, such a conclusion means to imply that we are not only required to have two contradictory pictures of reality but also compelled to abandon the objectiveness of the truth values, “true” and “false”. Yet, even if we could accept wave-like behavior of quantum particles as the best explanation for the build-up of an interference pattern in (...) the double-slit experiment, without the objectivity of the truth values we would never have certainty regarding any statement about the world. The present paper discusses ways to reconcile the correct description of the double-slit experiment with the objectiveness of “true” and “false”. (shrink)

CAMILO, Bruno. Aspectos metafísicos na física de Newton: Deus. In: DUTRA, Luiz Henrique de Araújo; LUZ, Alexandre Meyer (org.). Temas de filosofia do conhecimento. Florianópolis: NEL/UFSC, 2011. p. 186-201. (Coleção rumos da epistemologia; 11). Através da análise do pensamento de Isaac Newton (1642-1727) encontramos os postulados metafísicos que fundamentam a sua mecânica natural. Ao deduzir causa de efeito, ele acreditava chegar a uma causa primeira de todas as coisas. A essa primeira causa de tudo, onde toda a ordem e leis (...) tiveram início, a qual para ele assume um caráter divino, Newton aponta para um Deus sábio e poderoso e responsável pela ordem inteligente e pela a harmonia das leis físicas e universais de tudo o que existe – Deus como criador e preservador da ordem do universo. Há ainda a analogia do conceito de Deus com o espaço e o tempo, na medida em que ambos comunicam infinitude e onipresença. Por fim, nas considerações finais apontarei a importância de Newton para a metafísica moderna e como os seus estudos contribuíram para uma visão posterior do universo e suas leis e do homem enquanto ser pensante. (shrink)

We investigate which part of Brouwer’s Intuitionistic Mathematics is finitistically justifiable or guaranteed in Hilbert’s Finitism, in the same way as similar investigations on Classical Mathematics (i.e., which part is equiconsistent with$\textbf {PRA}$or consistent provably in$\textbf {PRA}$) already done quite extensively in proof theory and reverse mathematics. While we already knew a contrast from the classical situation concerning the continuity principle, more contrasts turn out: we show that several principles are finitistically justifiable or guaranteed which are classically not. Among them (...) are:(i)fan theorem for decidable fans but arbitrary bars;(ii)continuity principle and the axiom of choice both for arbitrary formulae; and(iii)$\Sigma _2$induction and dependent choice. We also show that Markov’s principle MP does not change this situation; that neither does lesser limited principle of omniscience LLPO (except the choice along functions); but that limited principle of omniscience LPO makes the situation completely classical. (shrink)

We explore the problems that confront any attempt to explain or explicate exactly what a primitive logical rule of inferenceis, orconsists in. We arrive at a proposed solution that places a surprisingly heavy load on the prospect of being able to understand and deal with specifications of rules that are essentiallyself-referring. That is, any rule$\rho $is to be understood via a specification that involves, embedded within it, reference to rule$\rho $itself. Just how we arrive at this position is explained by (...) reference to familiar rules as well as less familiar ones with unusual features. An inquiry of this kind is surprisingly absent from the foundations of inferentialism—the view that meanings of expressions (especially logical ones) are to be characterized by the rules of inference that govern them. (shrink)

Motivated by weaknesses with traditional accounts of logical epistemology, considerable attention has been paid recently to the view, known as anti-exceptionalism about logic, that the subject matter and epistemology of logic may not be so different from that of the recognised sciences. One of the most prevalent claims made by advocates of AEL is that theory choice within logic is significantly similar to that within the sciences. This connection with scientific methodology highlights a considerable challenge for the anti-exceptionalist, as two (...) uncontentious claims about scientific theories are that they attempt to explain a target phenomenon and prove their worth through successful predictions. Thus, if this methodological AEL is to be viable, the anti-exceptionalist will need a reasonable account of what phenomena logics are attempting to explain, how they can explain, and in what sense they can be said to issue predictions. This paper makes sense of the anti-exceptionalist proposal with a new account of logical theory choice, logical predictivism, according to which logics are engaged in both a process of prediction and explanation. (shrink)

Este livro marca o início da Série Investigação Filosófica. Uma série de livros de traduções de textos de plataformas internacionalmente reconhecidas, que possa servir tanto como material didático para os professores das diferentes subáreas e níveis da Filosofia quanto como material de estudo para o desenvolvimento pesquisas relevantes na área. Nós, professores, sabemos o quão difícil é encontrar bons materiais em português para indicarmos. E há uma certa deficiência na graduação brasileira de filosofia, principalmente em localizações menos favorecidas, com relação (...) ao conhecimento de outras línguas, como o inglês e o francês. Tentamos, então, suprir essa deficiência, ao introduzirmos traduções de textos importantes ao público de língua portuguesa, sem nenhuma finalidade comercial e meramente pela glória da filosofia. O presente volume é constituído de três traduções de verbetes importantes sobre lógica, da Enciclopédia de Filosofia da Stanford: (1) A Lógica de Aristóteles, (2) Lógica Clássica, (3) Lógica Modal. (shrink)

Different formal tools are useful for different purposes. For example, when it comes to modelling degrees of belief, probability theory is a better tool than classical logic; when it comes to modelling the truth of mathematical claims, classical logic is a better tool than probability theory. In this paper I focus on a widely used formal tool and argue that it does not provide a good model of a phenomenon of which many think it does provide a good model: I (...) shall argue that while supervaluationism may provide a model of probability of truth, or of assertability, it cannot provide a good model of truth -- supertruth cannot be truth. The core of the argument is that an adequate model of truth must render certain connectives truth-functional (at least in certain circumstances) -- and supervaluationism does not do so (in those circumstances). (shrink)

The paper is a critique of the widespread conception of logic as a neutral arbiter between metaphysical theories, one that makes no `substantive’ claims of its own (David Kaplan and John Etchemendy are two recent examples). A familiar observation is that virtually every putatively fundamental principle of logic has been challenged over the last century on broadly metaphysical grounds (however mistaken), with a consequent proliferation of alternative logics. However, this apparent contentiousness of logic is often treated as though it were (...) neutralized by the possibility of studying all these alternative logics within an agreed metalogical framework, typically that of first-order logic with set theory. In effect, metalogic is given the role of neutral arbiter. The paper will consider a variety of examples in which deep logical disputes re-emerge at the meta-level. One case is quantified modal logic, where some varieties of actualism require a modal meta-language (as opposed to the usual non-modal language of possible worlds model theory) in order not to make their denial of the Barcan formula self-defeating. Similarly, on some views the intended model theory for second-order logic can only be given in a second-order metalanguage—this may be needed to avoid versions of Russell’s paradox when the first-order quantifiers are read as absolutely unrestricted. It can be shown that the phenomenon of higher-order vagueness eventually forces fuzzy logical treatments of vagueness to use a fuzzy metalanguage, with consequent repercussions for what first-order principles are validated. The difficulty of proving the completeness of first-order intuitionistic logic on its intended interpretation by intuitionistically rather than just classically valid means is a more familiar example. These case studies will be discussed in some detail to reveal a variety of ways in which even metalogic is metaphysically contested, substantial and non-neutral. (shrink)

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (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 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)

Many advocates of non-classical logic for reasons external to mathematics claim that their proposed revisions are consistent with the use of classical logic within pure mathematics. Doubts are raised about such claims, concerning the applicability of pure mathematics to natural and social science. -/- .

Conditional logics have traditionally been intended to formalize various intuitively correct modes of reasoning involving conditional expressions in natural language. Although conditional logics have by now been thoroughly studied in a classical context, they have yet to be systematically examined in an intuitionistic context, despite compelling philosophical and technical reasons to do so. This paper addresses this gap by thoroughly examining the basic intuitionistic conditional logic ICK, the intuitionistic counterpart of Chellas’ important classical system CK. I give ICK both worlds (...) semantics and algebraic semantics, and prove that these are equivalent. I give a Gödel-type embedding of ICK into CK and a Glivenko-type embedding of CK into ICK. I axiomatize ICK and prove soundness, completeness, and decidability results. Finally, I discuss extending ICK. (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 novel solution to the knowability paradox is proposed based on Kant’s transcendental epistemology. The ‘paradox’ refers to a simple argument from the moderate claim that all truths are knowable to the extreme claim that all truths are known. It is significant because anti-realists have wanted to maintain knowability but reject omniscience. The core of the proposed solution is to concede realism about epistemic statements while maintaining anti-realism about non-epistemic statements. Transcendental epistemology supports such a view by providing for a (...) sharp distinction between how we come to understand and apply epistemic versus non-epistemic concepts, the former through our capacity for a special kind of reflective self-knowledge Kant calls ‘transcendental apperception’. The proposal is a version of restriction strategy: it solves the paradox by restricting the anti-realist’s knowability principle. Restriction strategies have been a common response to the paradox but previous versions face serious difficulties: either they result in a knowability principle too weak to do the work anti-realists want it to, or they succumb to modified forms of the paradox, or they are ad hoc. It is argued that restricting knowability to non-epistemic statements by conceding realism about epistemic statements avoids all versions of the paradox, leaves enough for the anti-realist attack on classical logic, and, with the help of transcendental epistemology, is principled in a way that remains compatible with a thoroughly anti-realist outlook. (shrink)

In his famous paper, An Unsolvable Problem of Elementary Number Theory, Alonzo Church identified the intuitive notion of effective calculability with the mathematically precise notion of recursiveness. This proposal, known as Church's Thesis, has been widely accepted. Only a few papers have been written against it. One of these is László Kalmár's An Argument Against the Plausibility of Church's Thesis from 1959. The aim of this paper is to present Kalmár's argument and to fill in missing details based on his (...) general philosophical thoughts on mathematics. (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)

We introduce a sequent calculusBfor a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic. quantum and non-modal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterizeBpositively: reflection, symmetry and visibility.A logical constant obeys to the principle of reflection if it is characterized semantically by an equation binding it with a metalinguistic link between assertions, (...) and if its syntactic inference rules are obtained by solving that equation. All connectives of basic logic satisfy reflection.To the control of weakening and contraction of linear logic, basic logic adds a strict control of contexts, by requiring that all active formulae in all rules are isolated, that is visible. From visibility, cut-elimination follows. The full, geometric symmetry of basic logic induces known symmetries of its extensions, and adds a symmetry among them, producing the structure of a cube. (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)

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)

First published in 2002. Routledge is an imprint of Taylor & Francis, an informa company.

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)

It is argued that indicative conditionals are best viewed as having truth conditions (and so they are in part factual) but that these truth conditions are ‘gappy’ which leaves an explanatory gap that can only be filled by epistemic considerations (and so indicative conditionals are in part epistemic). This dual nature of indicative conditionals gives reason to rethink the relationship between logic viewed as a descriptive discipline (focusing on semantics) and logic viewed as a discipline with a normative import (focusing (...) on epistemic notions such as ‘reasoning’, ‘beliefs’ and ‘assumptions’). In particular, it is argued that the development of formal models for epistemic states can serve as a starting point for exploring logic when viewed as a normative discipline. (shrink)

This paper considers logics which are formally dual to intuitionistic logic in order to investigate a co-constructive logic for proofs and refutations. This is philosophically motivated by a set of problems regarding the nature of constructive truth, and its relation to falsity. It is well known both that intuitionism can not deal constructively with negative information, and that defining falsity by means of intuitionistic negation leads, under widely-held assumptions, to a justification of bivalence. For example, we do not want to (...) equate falsity with the non-existence of a proof since this would render a statement such as “pi is transcendental” false prior to 1882. In addition, the intuitionist account of negation as shorthand for the derivation of absurdity is inadequate, particularly outside of purely mathematical contexts. To deal with these issues, I investigate the dual of intuitionistic logic, co-intuitionistic logic, as a logic of refutation, alongside intuitionistic logic of proofs. Direct proof and refutation are dual to each other, and are constructive, whilst there also exist syntactic, weak, negations within both logics. In this respect, the logic of refutation is weakly paraconsistent in the sense that it allows for statements for which, neither they, nor their negation, are refuted. I provide a proof theory for the co-constructive logic, a formal dualizing map between the logics, and a Kripke-style semantics. This is given an intuitive philosophical rendering in a re-interpretation of Kolmogorov’s logic of problems. (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.

Scientific pluralism is an issue at the forefront of philosophy of science. This landmark work addresses the question, Can pluralism be advanced as a general, philosophical interpretation of science?

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

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)

Mathematicians often speak of conjectures, yet unproved, as probable or well-confirmed by evidence. The Riemann Hypothesis, for example, is widely believed to be almost certainly true. There seems no initial reason to distinguish such probability from the same notion in empirical science. Yet it is hard to see how there could be probabilistic relations between the necessary truths of pure mathematics. The existence of such logical relations, short of certainty, is defended using the theory of logical probability (or objective Bayesianism (...) or non-deductive logic), and some detailed examples of its use in mathematics surveyed. Examples of inductive reasoning in experimental mathematics are given and it is argued that the problem of induction is best appreciated in the mathematical case. (shrink)

This study is in two parts. In the first part, various important principles of classical extensional mereology are derived on the basis of a nice axiomatization involving ‘part of’ and fusion. All results are proved here with full Fregean rigor. They are chosen because they are needed for the second part. In the second part, this natural-deduction framework is used in order to regiment David Lewis’s justification of his Division Thesis, which features prominently in his combination of mereology with class (...) theory. The Division Thesis plays a crucial role in Lewis’s informal argument for his Second Thesis in his book Parts of Classes. In order to present Lewis’s argument in rigorous detail, an elegant new principle is offered for the theory that combines class theory and mereology. The new principle is called the Canonical Decomposition Thesis. It secures Lewis’s Division Thesis on the strong construal required in order for his argument to go through. The exercise illustrates how careful one has to be when setting up the details of an adequate foundational theory of parts and classes. The main aim behind this investigation is to determine whether an anti-realist, inferentialist theorist of meaning has the resources to exhibit Lewis’s argument for his Second Thesis—which is central to his marriage of class theory with mereology—as a purely conceptual one. The formal analysis shows that Lewis’s argument, despite its striking appearance to the contrary, can be given in the constructive, relevant logic IR. This is the logic that the author has argued, elsewhere, to be the correct logic from an anti-realist point of view. The anti-realist is therefore in a position to regard Lewis’s argument as purely conceptual. (shrink)

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.

Call an argument a ‘happy sorites’ if it is a sorites argument with true premises and a false conclusion. It is a striking fact that although most philosophers working on the sorites paradox find it at prima facie highly compelling that the premises of the sorites paradox are true and its conclusion false, few (if any) of the standard theories on the issue ultimately allow for happy sorites arguments. There is one philosophical view, however, that appears to allow for at (...) least some happy sorites arguments: strict finitism in the philosophy of mathematics. My aim in this paper is to explore to what extent this appearance is accurate. As we shall see, this question is far from trivial. In particular, I will discuss two arguments that threaten to show that strict finitism cannot consistently accept happy sorites arguments, but I will argue that (given reasonable assumptions on strict finitistic logic) these arguments can ultimately be avoided, and the view can indeed allow for happy sorites arguments. (shrink)