Intuitionistic Logic

Errett Bishop's work in constructive mathematics is overwhelmingly regarded as a turning point for mathematics based on intuitionistic logic. It brought new life to this form of mathematics and prompted the development of new areas of research that witness today's depth and breadth of constructive mathematics. Surprisingly, notwithstanding the extensive mathematical progress since the publication in 1967 of Errett Bishop's Foundations of Constructive Analysis, there has been no corresponding advances in the philosophy of constructive mathematics Bishop style. The aim of (...) this paper is to foster the philosophical debate about this form of mathematics. I begin by considering key elements of philosophical remarks by Bishop, especially focusing on Bishop's assessment of Brouwer. I then compare these remarks with ``traditional'' philosophical arguments for intuitionistic logic and argue that the latter are in tension with Bishop's views. ``Traditional'' arguments for intuitionistic logic turn out to be also in conflict with significant recent developments in constructive mathematics. This rises pressing questions for the philosopher of mathematics, especially with regard to the possibility of offering alternative philosophical arguments for constructive mathematics. I conclude with the suggestion to look anew at Bishop's own remarks for inspiration. (shrink)

Fine (2017) proposes a new logic of vagueness, CL, that promises to provide both a solution to the sorites paradox and a way to avoid the impossibility result from Fine (2008). The present paper presents a challenge to his new theory of vagueness. I argue that the possibility theorem stated in Fine (2017), as well as his solution to the sorites paradox, fail in certain reasonable extensions of the language of CL. More specifically, I show that if we extend the (...) language with any negation operator that obeys reductio ad absurdum, we can prove a new impossibility result that makes the kind of indeterminacy that Fine takes to be a hallmark of vagueness impossible. I show that such negation operators can be conservatively added to CL and examine some of the philosophical consequences of this result. Moreover, I demonstrate that we can define a particular negation operator that behaves exactly like intuitionistic negation in a natural and unobjectionable propositionally quantified extension of CL. Since intuitionistic negation obeys reductio, the new impossibility result holds in this propositionally quantified extension of CL. In addition, the sorites paradox resurfaces for the new negation. (shrink)

Negation often reinforces problematic habits of othering, but rethinking negation can make good on feminist hopes for logic as a transformative space for inclusion. As Plumwood argues in her 1993 paper, not all uses of negation in the context of social identity are inherently problematic, but the widespread implicit use of classical negation has limited our options with respect to representing difference, ultimately reinforcing dualisms that essentialize social differences in problematic ways. In response to these limitations, I take inspiration from (...) Dembroff’s recent work on the metaphysics of genderqueer identity to build models of social identity using the Heyting-Brouwer logic developed by Rauszer in her 1974 paper. Ultimately, I argue that these models demonstrate both how classical negation reinforces problematic habits of othering and how alternative forms of negation can transform our treatment of social identity altogether. (shrink)

This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the $\invertediota$ operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas additional to those familiar from standard intuitionist and classical logic. When $\invertediota$ is added it must be ensured that reduction procedures involving replacements of parameters by terms do not introduce new maximal formulas of higher degree than the ones removed. The problem is solved by a rule (...) that permits restricting these terms in the rules for $\forall$, $\exists$ and $\invertediota$ to parameters or constants. A restricted subformula property for deductions in systems without $\invertediota$ is considered. It is improved upon by an alternative formalisation of free logic building on an idea of Ja\'skowski's. In the classical system the rules for $\invertediota$ require treatment known from normalisation for classical logic with $\lor$ or $\exists$. The philosophical significance of the results is also indicated. (shrink)

In his essay ‘“Wang’s Paradox”’, Crispin Wright proposes a solution to the Sorites Paradox (in particular, the form of it he calls the ‘Paradox of Sharp Boundaries’) that involves adopting intuitionistic logic when reasoning with vague predicates. He does not give a semantic theory which accounts for the validity of intuitionistic logic (and the invalidity of stronger logics) in that area. The present essay tentatively makes good the deficiency. By applying a theorem of Tarski, it shows that intuitionistic logic is (...) the strongest logic that may be applied, given certain semantic assumptions about vague predicates. The essay ends with an inconclusive discussion of whether those semantic assumptions should be accepted. (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have been (...) expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

We investigate a recently devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally complete if it is complete with respect to some class of polyhedra. The first main result of this paper is a necessary and sufficient condition for the polyhedral completeness of a logic. This condition, which we call the Nerve Criterion, is expressed in terms of Alexandrov’s notion of the nerve of a poset. It affords a purely combinatorial (...) characterisation of polyhedrally complete logics. Using the Nerve Criterion we show, easily, that there are continuum many intermediate logics that are not polyhedrally complete but which have the finite model property. We also provide, at considerable combinatorial labour, a countably infinite class of logics axiomatised by the Jankov–Fine formulas of ‘starlike trees’ all of which are polyhedrally complete. The polyhedral completeness theorem for these ‘starlike logics’ is the second main result of this paper. (shrink)

In this Dissertation, we examine a handful of related themes in the philosophy of logic and mathematics. We take as a starting point the deeply philosophical, and—as we argue, deeply Kantian—views of L.E.J. Brouwer, the founder of intuitionism. We examine his famous first act of intuitionism. Therein, he put forth both a critical and a constructive idea. This critical idea involved digging a philosophical rift between what he thought of himself as doing and what he thought of his contemporaries, specifically (...) Hilbert, as doing. He sought to completely separate mathematics from mathematical language, and thereby logic. In chapter 3, we examine the philosophical foundations for this separation. Artemov Artemov (2001) articulates what we might think of as constructive propositional reasoning in a formal system that augments classical propositional logic with a theory of proofs. In doing this, instead of using just one type of object to characterize constructive reasoning, he uses two; propositions and proofs. In chapter 4, we explore the extent to which it might make sense to think of classical propositional reasoning as instead a theory that has two types of objects in the Artemov style. In chapters 5 and 6, we examine two specific case studies; we look at two philosophical phenomena that admit of formal characterizations and then propose those. In both cases, we focus on predicate style treatments of modality. (shrink)

Without directly addressing the Demarcation Problem for logic—the problem of distinguishing logical vocabulary from others—we focus on distinctive aspects of logical vocabulary in pursuit of a second goal in the philosophy of logic, namely, proposing criteria for the justification of logical rules. Our preferred approach has three components. Two of these are effectively Belnap’s, but with a twist. We agree with Belnap’s response to Prior’s challenge to inferentialist characterisations of the meanings of logical constants. Belnap argued that for a logical (...) constant to exist, its rules must be conservative over a previously given consequence relation and guarantee the uniqueness of the constant. The twist is that we require logical vocabulary to be provably conservative, not over a previously given formal consequence relation, but over a previously given meaningful vocabulary of a language. Uniqueness is also a feature defined in terms of provability: if two syntactically distinguished expressions are governed by the same rules, then formulas with them as main operators are interderivable. Belnap’s criteria are not only those for the existence of a logical constant, but more: they are what distinguishes logical vocabulary from all other expressions. It is the defining mark of a logical constant that it is provably conservative over the fragment of the language which excludes it and that its rules guarantee its uniqueness. The third component is the topic neutrality of logic. The provable conservativeness of logic over a previously given vocabulary of a language is motivated, in part, by appeal to molecularism in the theory of meaning. Molecularity is a feature endorsed by the theory of meaning as a whole, so it does not distinguish logical constants from other expressions. The same is true for conservativeness. We argue that molecularity, and hence conservativeness, are implicit presuppositions of speakers’ use of language: the addition of new vocabulary to a language is presupposed to be conservative. But this presupposition is one that we should be able reflectively to endorse (such as when attempting a rational reconstruction of the use of the vocabulary). Thus, where conservativeness is found to fail, this defect should be remedied and the use of the vocabulary corrected (as in classical negation) or excised altogether (as in pejoratives). We go on to characterise a notion of topic neutrality, which we argue applies to logical vocabulary. We then note that reflective endorsement of the conservativeness of a topic neutral vocabulary requires a proof that the vocabulary is conservative relative to any base vocabulary. Thus we require that logical vocabulary be demonstrably conservative. Allying this requirement, distinctive of logic, to a general consideration about the commitments of assertion yields a mode of justification for logical constants akin to some conceptions of Harmony, i.e., to the idea that the consequences of assertion of a logical complex need to be warranted by the grounds and ought to be the strongest consequences warranted by the grounds. Intuitionistic logic acquires a somewhat familiar justification but emanating from a new motivation. (shrink)

Brouwer’s intuitionism was a far-reaching attempt to reform the foundations of mathematics. While the mathematical community was reluctant to accept Brouwer’s work, its response to later-developed brands of intuitionism, such as those presented by Hermann Weyl and Arend Heyting, was different. The paper accounts for this difference by analyzing the intuitionistic versions of Brouwer, Weyl, and Heyting in light of a two-tiered model of the body and image of mathematical knowledge. Such a perspective provides a richer account of each story (...) and points to a possible connection between the community’s reaction and the changes each mathematician had proposed. (shrink)

I argue against the interpretation of propositions as intentions and proof-objects as fulfillments proposed by Heyting and defended by Tieszen and van Atten. The idea is already a frequent target of criticisms regarding the incompatibility of Brouwer’s and Husserl’s positions, mainly by Rosado Haddock and Hill. I raise a stronger objection in this paper. My claim is that even if we grant that the incompatibility can be properly dealt with, as van Atten believes it can, two fundamental issues indicate that (...) the interpretation is unsustainable regardless: (1) it is hard to determine, without appealing to propositional intentions on pain of circularity, what intention a proof-object should be understood as a fulfillment of; (2) due to a difficult fulfillment dilemma, it is unclear, at best, what the object of an intention corresponding to a proposition is. (shrink)

Chapter 1 constitutes an introduction to Gentzen calculi from two perspectives, logical and philosophical. It introduces the notion of generalisations of Gentzen sequent calculus and the discussion on properties that characterize good inferential systems. Among the variety of Gentzen-style sequent calculi, I divide them in two groups: syntactic and semantic generalisations. In the context of such a discussion, the inferentialist philosophy of the meaning of logical constants is introduced, and some potential objections – mainly concerning the choice of working with (...) semantic generalizations – are addressed. Finally, I’ll introduce the case studies that I’ll be dealing with in part II. Chapter 2 is concerned with the origins and development of Jaśkowski’s discussive logic. The main idea of this chapter is to systematize the various stages of the development of discussive logic related researches from two different angles, i.e., its connections to modal logics and its proof theory, by highlighting virtues and vices. Chapter 3 focuses on the Gentzen-style proof theory of discussive logic, by providing a characterization of it in terms of labelled sequent calculi. Chapter 4 deals with the Gentzen-style proof theory of relevant logics, again by employing the methodology of labelled sequent calculi. This time, instead of working with a single logic, I’ll deal with a whole family of them. More precisely, I’ll study in terms of proof systems those relevant logics that can be characterised, at the semantic level, by reduced Routley-Meyer models, i.e., relational structures with a ternary relation between states and a unique base element. Chapter 5 investigates the proof theory of a modal expansion of intuitionistic propositional logic obtained by adding an ‘actuality’ operator to the connectives. This logic was introduced also using Gentzen sequents. Unfortunately, the original proof system is not cut-free. This chapter shows how to solve this problem by moving to hypersequents. Chapter 6 concludes the investigations and discusses the future of the research presented throughout the dissertation. (shrink)

In his paper ‘The possibility of vagueness’ (Fine in Synthese 194(10):3699–3725, 2017), Kit Fine proposes a new logic of vagueness, CL, that promises to provide both a solution to the sorites paradox and a way to avoid the impossibility result from Fine (Philos Perspect 22(1):111–136, 2008). The present paper presents a challenge to his new theory of vagueness. I argue that the possibility theorem stated in Fine (Synthese 194(10):3699–3725, 2017), as well as his solution to the sorites paradox, fail in (...) certain reasonable extensions of the language of CL. More specifically, I show that if we extend the language with any negation operator that obeys reductio ad absurdum, we can prove a new impossibility result that makes the kind of indeterminacy that Fine takes to be a hallmark of vagueness impossible. I show that such negation operators can be conservatively added to CL and examine some of the philosophical consequences of this result. Moreover, I demonstrate that we can define a particular negation operator that behaves exactly like intuitionistic negation in a natural and unobjectionable propositionally quantified extension of CL. Since intuitionistic negation obeys reductio, the new impossibility result holds in this propositionally quantified extension of CL. In addition, the sorites paradox resurfaces for the new negation. (shrink)

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional logic with (...) implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (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)

Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...) and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic. (shrink)

In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one of Gödel (...) 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. -/- From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained. (shrink)

Among Dunn’s many important contributions to relevance logic was his work on the system RM (R-mingle). Although RM is an interesting system in its own right, it is widely considered to be too strong. In this chapter, I revisit a closely related system, RM0 (sometimes known as ‘constructive mingle’), which includes the mingle axiom while not degenerating in the way that RM itself does. My main interest will be in examining this logic from two related semantical perspectives. First, I give (...) a purely operational bisemilattice semantics for it by adapting previous work of Humberstone. Second, I examine a more conventional algebraic semantics for it and discuss how this relates to the operational semantics. A novel operational semantics for J (intuitionistic logic) as well as its conventional Heyting algebraic semantics emerge as special cases of the corresponding semantics for RM0. The results of this chapter suggest that RM0 is a more interesting logic than has been appreciated and that Humberstone’s operational semantic framework similarly deserves more attention than it has received. (shrink)

This article proposes a way of doing type theory informally, assuming a cubical style of reasoning. It can thus be viewed as a first step toward a cubical alternative to the program of informalization of type theory carried out in the homotopy type theory book for dependent type theory augmented with axioms for univalence and higher inductive types. We adopt a cartesian cubical type theory proposed by Angiuli, Brunerie, Coquand, Favonia, Harper, and Licata as the implicit foundation, confining our presentation (...) to elementary results such as function extensionality, the derivation of weak connections and path induction, the groupoid structure of types, and the Eckmman–Hilton duality. (shrink)

In this book set theory INC# based on intuitionistic logic with restricted modus ponens rule is proposed. It proved that intuitionistic logic with restricted modus ponens rule can to safe Cantor naive set theory from a triviality.

In this book set theory INC# based on intuitionistic logic with restricted modus ponens rule is proposed. It proved that intuitionistic logic with restricted modus ponens rule can to safe Cantor naive set theory from a triviality. Similar results for paraconsistent set theories were obtained in author papers [13]-[16].

This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section 2 presents (...) the model-theoretic concepts, based on those in [7], that guide the rest of this paper. Section 3 presents Natural Deduction systems IK and CK, formalizations of intuitionistic and classical one-step versions of K. In these systems, occurrences of step-markers allow deductions to display deductive structure that is covered over in familiar “no step” proof-theoretic systems for such logics. Box and Diamond are governed by Introduction and Elimination rules; the familiar K rule and Necessitation are derived (i.e. admissible) rules. CK will be the result of adding the 0-version of the Rule of Excluded Middle to the rules which generate IK. Note: IK is the result of merely dropping that rule from those generating CK, without addition of further rules or axioms (as was needed in [7]). These proof-theoretic systems yield intuitionistic and classical consequence relations by the obvious definition. Section 4 provides some examples of what can be deduced in IK. Section 5 defines some proof-theoretic concepts that are used in Section 6 to prove the soundness of the consequence relation for IK (relative to the class of models defined in Section 2.) Section 7 proves its completeness (relative to that class). Section 8 extends these results to the consequence relation for CK. (Looking ahead: Part 2 will investigate one-step proof-theoretic systems formalizing intuitionistic and classical one-step versions of some familiar logics stronger than K.). (shrink)

This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and that deductions (...) in normal form have the subformula property. (shrink)

Relevant logics infamously have the property that they only validate a conditional when some propositional variable is shared between its antecedent and consequent. This property has been strengthened in a variety of ways over the last half-century. Two of the more famous of these strengthenings are the strong variable sharing property and the depth relevance property. In this paper I demonstrate that an appropriate class of relevant logics has a property that might naturally be characterized as the supremum of these (...) two properties. I also show how to use this fact to demonstrate that these logics seem to be constructive in previously unknown ways. (shrink)

This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly incorporates the (...) semantics of the associated logic, and such systems typically violate the subformula property to a high degree. By contrast, nested sequent calculi employ a simpler syntax and adhere to a strict reading of the subformula property, making such systems useful in the design of automated reasoning algorithms. However, the downside of the nested sequent paradigm is that a general theory concerning the automated construction of such calculi (as in the labelled setting) is essentially absent, meaning that the construction of nested systems and the confirmation of their properties is usually done on a case-by-case basis. The refinement method connects both paradigms in a fruitful way, by transforming labelled systems into nested (or, refined labelled) systems with the properties of the former preserved throughout the transformation process. To demonstrate the method of refinement and some of its applications, we consider grammar logics, first-order intuitionistic logics, and deontic STIT logics. The introduced refined labelled calculi will be used to provide the first proof-search algorithms for deontic STIT logics. Furthermore, we employ our refined labelled calculi for grammar logics to show that every logic in the class possesses the effective Lyndon interpolation property. (shrink)

This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated labelled calculi, such as (...) completeness, invertibility of rules and cut admissibility. Since labelled calculi are easily obtained via a logic’s semantics, the method presented in this paper can be seen as one whereby refined versions of labelled calculi (containing nested calculi as fragments) with favourable properties are derived directly from a logic’s semantics. (shrink)

Intuitionistic Propositional Logic is proved to be an infinitely many valued logic by Gödel (Kurt Gödel collected works (Volume I) Publications 1929–1936, Oxford University Press, pp 222–225, 1932), and it is proved by Jaśkowski (Actes du Congrés International de Philosophie Scientifique, VI. Philosophie des Mathématiques, Actualités Scientifiques et Industrielles 393:58–61, 1936) to be a countably many valued logic. In this paper, we provide alternative proofs for these theorems by using models of Kripke (J Symbol Logic 24(1):1–14, 1959). Gödel’s proof gave (...) rise to an intermediate propositional logic (between intuitionistic and classical), that is known nowadays as Gödel or the Gödel-Dummett Logic, and is studied by fuzzy logicians as well. We also provide some results on the inter-definability of propositional connectives in this logic. (shrink)

In this paper, I revisit Frege's theory of sense and reference in the constructive setting of the meaning explanations of type theory, extending and sharpening a program–value analysis of sense and reference proposed by Martin-Löf building on previous work of Dummett. I propose a computational identity criterion for senses and argue that it validates what I see as the most plausible interpretation of Frege's equipollence principle for both sentences and singular terms. Before doing so, I examine Frege's implementation of his (...) theory of sense and reference in the logical framework of Grundgesetze, his doctrine of truth values, and views on sameness of sense as equipollence of assertions. (shrink)

Intuitionistic logic provides an elegant solution to the Sorites Paradox. Its acceptance has been hampered by two factors. First, the lack of an accepted semantics for languages containing vague terms has led even philosophers sympathetic to intuitionism to complain that no explanation has been given of why intuitionistic logic is the correct logic for such languages. Second, switching from classical to intuitionistic logic, while it may help with the Sorites, does not appear to offer any advantages when dealing with the (...) so-called paradoxes of higher-order vagueness. We offer a proposal that makes strides on both issues. We argue that the intuitionist’s characteristic rejection of any third alethic value alongside true and false is best elaborated by taking the normal modal system S4M to be the sentential logic of the operator ‘it is clearly the case that’. S4M opens the way to an account of higher-order vagueness which avoids the paradoxes that have been thought to infect the notion. S4M is one of the modal counterparts of the intuitionistic sentential calculus and we use this fact to explain why IPC is the correct sentential logic to use when reasoning with vague statements. We also show that our key results go through in an intuitionistic version of S4M. Finally, we deploy our analysis to reply to Timothy Williamson’s objections to intuitionistic treatments of vagueness. (shrink)

There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express meta-logical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the Logics of Formal Inconsistency (LFIs) and by the Logics of Formal Undeterminedness (LFUs). LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs recover the (...) validity of the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core– in the case studied here, this common core is classical positive propositional logic (CPL + ). The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of logics of formal inconsistency and undeterminedness (LFIUs), namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion at once. The last sections offer an algebraic account for such logics by adapting the swap-structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite non-deterministic matrices. (shrink)

In this historical article, Newton da Costa discusses Francisco Miró Quesada’s philosophical ideas about logic. He discusses the topics of reason, logic, and action in Miró Quesada’s work, and in the final section he offers his critical view. In particular, he disagrees with Miró Quesada’s stance on the historicity of reason, for whom “reason is essentially absolute”, whereas for da Costa it “is being constructed in the course of history”. Da Costa concludes by emphasizing the importance of Miró Quesada’s theory (...) of logic and reason, despite it still being incomplete. -/- Historical article by Newton da Costa, annotated and translated by J. C. Cifuentes and L. F. Bartolo Alegre. (shrink)

In 2016 Beziau, introduce a more restricted concept of paraconsistency, namely the genuine paraconsistency. He calls genuine paraconsistent logic those logic rejecting φ, ¬φ |- ψ and |- ¬(φ ∧ ¬φ). In that paper the author analyzes, among the three-valued logics, which of these logics satisfy this property. If we consider multiple-conclusion consequence relations, the dual properties of those above mentioned are: |- φ, ¬φ, and ¬(ψ ∨ ¬ψ) |- . We call genuine paracomplete logics those rejecting the mentioned properties. (...) We present here an analysis of the three-valued genuine paracomplete logics. (shrink)

This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures a notion of validity. A notion of relative necessary is defined in terms of it, which expresses a necessary connection between the assumptions and the conclusion of a deduction.

This paper presents rules of inference for a binary quantifier I for the formalisation of sentences containing definite descriptions within intuitionist positive free logic. I binds one variable and forms a formula from two formulas. Ix[F, G] means ‘The F is G’. The system is shown to have desirable proof-theoretic properties: it is proved that deductions in it can be brought into normal form. The discussion is rounded up by comparisons between the approach to the formalisation of definite descriptions recommended (...) here and the more usual approach that uses a term-forming operator ι, where ιxF means ‘the F’. (shrink)

We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting to embeddings, (...) semantic arguments, or interpreted connectives external to the underlying logical language. A novel feature of our proof includes an orthogonality condition for defining duality between interpolants. (shrink)

Sentences containing definite descriptions, expressions of the form ‘The F’, can be formalised using a binary quantifier ι that forms a formula out of two predicates, where ιx[F, G] is read as ‘The F is G’. This is an innovation over the usual formalisation of definite descriptions with a term forming operator. The present paper compares the two approaches. After a brief overview of the system INFι of intuitionist negative free logic extended by such a quantifier, which was presented in (...) (Kürbis 2019), INFι is first compared to a system of Tennant’s and an axiomatic treatment of a term forming ι operator within intuitionist negative free logic. Both systems are shown to be equivalent to the subsystem of INFι in which the G of ιx[F, G] is restricted to identity. INFι is then compared to an intuitionist version of a system of Lambert’s which in addition to the term forming operator has an operator for predicate abstraction for indicating scope distinctions. The two systems will be shown to be equivalent through a translation between their respective languages. Advantages of the present approach over the alternatives are indicated in the discussion. (shrink)

This paper presents a way of formalising definite descriptions with a binary quantifier ι, where ιx[F, G] is read as ‘The F is G’. Introduction and elimination rules for ι in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form ιx[F, G] are given, and it is shown that deductions in the system can be brought into normal form.

The ideal of the United Nations was first put forward by Immanuel Kant in his 1795 essay Perpetual Peace. Kant, in the tradition of Locke and Rousseau is a liberal who believes that relations between individuals can either be based upon law and consent or upon force and violence. One way that such the ideal of world peace could be achieved would be through the creation of a single world state, of which every human being was a citizen. Such an (...) ideal was advocated by a number of eighteenth century liberals. Kant, however, rejects this ideal and instead argues that the universal rule of law can be achieved through the establishment a federation of independent states. I examine the relevance of Kant’s arguments today, focusing on two questions: Firstly, as advocates of the rule of law, why advocate a federation of independent nations rather than a single world state. Secondly, is this ideal realizable? Is Kant right to think that republics are natural and are likely to live peacefully with one another? Kant’s arguments on this issue have been taken up again in recent decades by defenders of the theory of the “democratic peace”, the theory that democracies are more likely to live at peace with one another. (shrink)

A textbook for modal and other intensional logics based on the Open Logic Project. It covers normal modal logics, relational semantics, axiomatic and tableaux proof systems, intuitionistic logic, and counterfactual conditionals.

We reconsider the pragmatic interpretation of intuitionistic logic [21] regarded as a logic of assertions and their justi cations and its relations with classical logic. We recall an extension of this approach to a logic dealing with assertions and obligations, related by a notion of causal implication [14, 45]. We focus on the extension to co-intuitionistic logic, seen as a logic of hypotheses [8, 9, 13] and on polarized bi-intuitionistic logic as a logic of assertions and conjectures: looking at the (...) S4 modal translation, we give a de nition of a system AHL of bi-intuitionistic logic that correctly represents the duality between intuitionistic and co-intuitionistic logic, correcting a mistake in previous work [7, 10]. A computational interpretation of cointuitionism as a distributed calculus of coroutines is then used to give an operational interpretation of subtraction.Work on linear co-intuitionism is then recalled, a linear calculus of co-intuitionistic coroutines is de ned and a probabilistic interpretation of linear co-intuitionism is given as in [9]. Also we remark that by extending the language of intuitionistic logic we can express the notion of expectation, an assertion that in all situations the truth of p is possible and that in a logic of expectations the law of double negation holds. Similarly, extending co-intuitionistic logic, we can express the notion of conjecture that p, de ned as a hypothesis that in some situation the truth of p is epistemically necessary. (shrink)

Bilateralism is a theory of meaning according to which assertion and denial are independent speech acts. Bilateralism also proposes two coordination principles for assertion and denial. I argue that if assertion and denial are independent speech acts, they cannot be coordinated by the bilateralist principles.

In The Boundary Stones of Thought, Rumfitt defends classical logic against challenges from intuitionistic mathematics and vagueness, using a semantics of pre-topologies on possibilities, and a topological semantics on predicates, respectively. These semantics are suggestive but the characterizations of negation face difficulties that may undermine their usefulness in Rumfitt’s project.

We discuss the philosophical implications of formal results showing the con- sequences of adding the epsilon operator to intuitionistic predicate logic. These results are related to Diaconescu’s theorem, a result originating in topos theory that, translated to constructive set theory, says that the axiom of choice (an “existence principle”) implies the law of excluded middle (which purports to be a logical principle). As a logical choice principle, epsilon allows us to translate that result to a logical setting, where one can (...) get an analogue of Diaconescu’s result, but also can disentangle the roles of certain other assumptions that are hidden in mathematical presentations. It is our view that these results have not received the attention they deserve: logicians are unlikely to read a discussion because the results considered are “already well known,” while the results are simultaneously unknown to philosophers who do not specialize in what most philosophers will regard as esoteric logics. This is a problem, since these results have important implications for and promise signif i cant illumination of contem- porary debates in metaphysics. The point of this paper is to make the nature of the results clear in a way accessible to philosophers who do not specialize in logic, and in a way that makes clear their implications for contemporary philo- sophical discussions. To make the latter point, we will focus on Dummettian discussions of realism and anti-realism. Keywords: epsilon, axiom of choice, metaphysics, intuitionistic logic, Dummett, realism, antirealism. (shrink)

ABSTRACT Topos quantum theory is standardly portrayed as a kind of ‘neo-realist’ reformulation of quantum mechanics.1 1 In this article, I study the extent to which TQT can really be characterized as a realist formulation of the theory, and examine the question of whether the kind of realism that is provided by TQT satisfies the philosophical motivations that are usually associated with the search for a realist reformulation of quantum theory. Specifically, I show that the notion of the quantum state (...) is problematic for those who view TQT as a realist reformulation of quantum theory. 1Introduction 2Topos Quantum Theory 2.1Phase space 2.2Hilbert space 2.3Beyond Hilbert space 2.4Defining realism 2.5The spectral presheaf 2.6The logic of topos quantum theory 3Interpreting States in Topos Quantum Theory 4Interpreting Truth Values and Clopen Subobjects in Topos Quantum Theory 4.1Interpreting the truth values 4.2Interpreting Subcl 5Neo-realism 5.1The covariant approach 6Conclusion. (shrink)

In the study of modal and nonclassical logics, translations have frequently been employed as a way of measuring the inferential capabilities of a logic. It is sometimes claimed that two logics are “notational variants” if they are translationally equivalent. However, we will show that this cannot be quite right, since first-order logic and propositional logic are translationally equivalent. Others have claimed that for two logics to be notational variants, they must at least be compositionally intertranslatable. The definition of compositionality these (...) accounts use, however, is too strong, as the standard translation from modal logic to first-order logic is not compositional in this sense. In light of this, we will explore a weaker version of this notion that we will call schematicity and show that there is no schematic translation either from first-order logic to propositional logic or from intuitionistic logic to classical logic. (shrink)

There is widespread agreement that while on a Dummettian theory of meaning the justified logic is intuitionist, as its constants are governed by harmonious rules of inference, the situation is reversed on Huw Price's bilateralist account, where meanings are specified in terms of primitive speech acts assertion and denial. In bilateral logics, the rules for classical negation are in harmony. However, as it is possible to construct an intuitionist bilateral logic with harmonious rules, there is no formal argument against intuitionism (...) from the bilateralist perspective. Price gives an informal argument for classical negation based on a pragmatic notion of belief, characterised in terms of the differences they make to speakers' actions. The main part of this paper puts Price's argument under close scrutiny by regimenting it and isolating principles Price is committed to. It is shown that Price should draw a distinction between A or ¬A making a difference. According to Price, if A makes a difference to us, we treat it as decidable. This material allows the intuitionist to block Price's argument. Abandoning classical logic also brings advantages, as within intuitionist logic there is a precise meaning to what it might mean to treat A as decidable: it is to assume A ∨ ¬A. (shrink)

This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying judgement aggregation in logics that (...) are weaker than classical logic, we investigate whether some well-known impossibility results, that were tailored for classical logic, still apply to those weak systems. (shrink)

Given a few assumptions, the probability of a conjunction is raised, and the probability of its negation is lowered, by conditionalising upon one of the conjuncts. This simple result appears to bring Bayesian confirmation theory into tension with the prominent dogmatist view of perceptual justification – a tension often portrayed as a kind of ‘Bayesian objection’ to dogmatism. In a recent paper, David Jehle and Brian Weatherson observe that, while this crucial result holds within classical probability theory, it fails within (...) intuitionistic probability theory. They conclude that the dogmatist who is willing to take intuitionistic logic seriously can make a convincing reply to the Bayesian objection. In this paper, I argue that this conclusion is premature – the Bayesian objection can survive the transition from classical to intuitionistic probability, albeit in a slightly altered form. I shall conclude with some general thoughts about what the Bayesian objection to dogmatism does and doesn’t show. (shrink)

I am presenting a sequent calculus that extends a nonmonotonic consequence relation over an atomic language to a logically complex language. The system is in line with two guiding philosophical ideas: (i) logical inferentialism and (ii) logical expressivism. The extension defined by the sequent rules is conservative. The conditional tracks the consequence relation and negation tracks incoherence. Besides the ordinary propositional connectives, the sequent calculus introduces a new kind of modal operator that marks implications that hold monotonically. Transitivity fails, but (...) for good reasons. Intuitionism and classical logic can easily be recovered from the system. (shrink)

Ian Rumfitt has proposed systems of bilateral logic for primitive speech acts of assertion and denial, with the purpose of ‘exploring the possibility of specifying the classically intended senses for the connectives in terms of their deductive use’ : 810f). Rumfitt formalises two systems of bilateral logic and gives two arguments for their classical nature. I assess both arguments and conclude that only one system satisfies the meaning-theoretical requirements Rumfitt imposes in his arguments. I then formalise an intuitionist system of (...) bilateral logic which also meets those requirements. Thus Rumfitt cannot claim that only classical bilateral rules of inference succeed in imparting a coherent sense onto the connectives. My system can be extended to classical logic by adding the intuitionistically unacceptable half of a structural rule Rumfitt uses to codify the relation between assertion and denial. Thus there is a clear sense in which, in the bilateral framework, the difference between classicism and intuitionism is not one of the rules of inference governing negation, but rather one of the relation between assertion and denial. (shrink)