Adam Rieger and Gareth Young (Editors), Dialetheism and Its Applications, Trends in Logic 52, Springer, 2019, 176Pp., $89,00, Hardcover, ISBN 9783030302207
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
On Proof Interpretations and Linear Logic
On Proof Interpretations and Linear Logic On Proof Interpretations and Linear Logic Paulo Oliva Queen Mary, University of London, UK ([email protected]) Heyting Day Utrecht, 27 February 2015 To Anne Troelstra and Dick de Jongh 6 ?? - !A ::: - !A - ! ILLp ILLp ILLp = Intuit. predicate linear logic (!-free) On Proof Interpretations and Linear Logic Overview - ! IL ::: - IL interpretations IL = Intuitionistic predicate logic 6 ?? - !A ::: - !A On Proof Interpretations and Linear Logic Overview - ! IL ::: - IL interpretations - ! ILLp ILLp IL = Intuitionistic predicate logic ILLp = Intuit. predicate linear logic (!-free) ?? - !A ::: - !A On Proof Interpretations and Linear Logic Overview - ! IL ::: - IL interpretations 6 - ! ILLp ILLp IL = Intuitionistic predicate logic ILLp = Intuit. predicate linear logic (!-free) - !A ::: - !A On Proof Interpretations and Linear Logic Overview - ! IL ::: - IL interpretations 6 ?? - ! ILLp ILLp IL = Intuitionistic predicate logic ILLp = Intuit. predicate linear logic (!-free) On Proof Interpretations and Linear Logic Overview - ! IL ::: - IL interpretations 6 ?? - ! ILLp ILLp - !A ::: - !A IL = Intuitionistic predicate logic ILLp = Intuit. predicate linear logic (!-free) On Proof Interpretations and Linear Logic Outline 1 Proof Interpretations 2 Linear Logic 3 Unified Interpretation of Linear Logic On Proof Interpretations and Linear Logic Proof Interpretations Outline 1 Proof Interpretations 2 Linear Logic 3 Unified Interpretation of Linear Logic E.g. the set of prime numbers is infinite The book \Proofs from THE BOOK" contains six beautiful proofs of this Non-theorems map to the empty set E.g. the set of even numbers is finite Need to fix the formal system On Proof Interpretations and Linear Logic Proof Interpretations Formulas as Sets of Proofs Formulas as set of proofs A 7! fπ : π ` Ag The book \Proofs from THE BOOK" contains six beautiful proofs of this Non-theorems map to the empty set E.g. -
Dialetheists' Lies About the Liar
PRINCIPIA 22(1): 59–85 (2018) doi: 10.5007/1808-1711.2018v22n1p59 Published by NEL — Epistemology and Logic Research Group, Federal University of Santa Catarina (UFSC), Brazil. DIALETHEISTS’LIES ABOUT THE LIAR JONAS R. BECKER ARENHART Departamento de Filosofia, Universidade Federal de Santa Catarina, BRAZIL [email protected] EDERSON SAFRA MELO Departamento de Filosofia, Universidade Federal do Maranhão, BRAZIL [email protected] Abstract. Liar-like paradoxes are typically arguments that, by using very intuitive resources of natural language, end up in contradiction. Consistent solutions to those paradoxes usually have difficulties either because they restrict the expressive power of the language, orelse because they fall prey to extended versions of the paradox. Dialetheists, like Graham Priest, propose that we should take the Liar at face value and accept the contradictory conclusion as true. A logical treatment of such contradictions is also put forward, with the Logic of Para- dox (LP), which should account for the manifestations of the Liar. In this paper we shall argue that such a formal approach, as advanced by Priest, is unsatisfactory. In order to make contradictions acceptable, Priest has to distinguish between two kinds of contradictions, in- ternal and external, corresponding, respectively, to the conclusions of the simple and of the extended Liar. Given that, we argue that while the natural interpretation of LP was intended to account for true and false sentences, dealing with internal contradictions, it lacks the re- sources to tame external contradictions. Also, the negation sign of LP is unable to represent internal contradictions adequately, precisely because of its allowance of sentences that may be true and false. -
LOGIC BIBLIOGRAPHY up to 2008
LOGIC BIBLIOGRAPHY up to 2008 by L. Geldsetzer © Copyright reserved Download only for personal use permitted Heinrich Heine Universität Düsseldorf 2008 II Contents 1. Introductions 1 2. Dictionaries 3 3. Course Material 4 4. Handbooks 5 5. Readers 5 6. Bibliographies 6 7. Journals 7 8. History of Logic and Foundations of Mathematics 9 a. Gerneral 9 b. Antiquity 10 c. Chinese Antiquity 11 d. Scholastics 12 e. Islamic Medieval Scholastics 12 f. Modern Times 13 g. Contemporary 13 9. Classics of Logics 15 a. Antiquity 15 b. Medieval Scholastics 17 c. Modern and Recent Times 18 d. Indian Logic, History and Classics 25 10. Topics of Logic 27 1. Analogy and Metaphor, Likelihood 27 2. Argumentation, Argument 27 3. Axiom, Axiomatics 28 4. Belief, Believing 28 5. Calculus 29 8. Commensurability, see also: Incommensurability 31 9. Computability and Decidability 31 10. Concept, Term 31 11. Construction, Constructivity 34 12. Contradiction, Inconsistence, Antinomics 35 13. Copula 35 14. Counterfactuals, Fiction, see also : Modality 35 15. Decision 35 16. Deduction 36 17. Definition 36 18. Diagram, see also: Knowledge Representation 37 19. Dialectic 37 20. Dialethism, Dialetheism, see also: Contradiction and Paracon- sistent Logic 38 21. Discovery 38 22. Dogma 39 23. Entailment, Implication 39 24. Evidence 39 25. Falsity 40 26. Fallacy 40 27. Falsification 40 III 28. Family Resemblance 41 2 9. Formalism 41 3 0. Function 42 31. Functors, Junct ors, Logical Constants or Connectives 42 32. Holism 43 33. Hypothetical Propositions, Hypotheses 44 34. Idealiz ation 44 35. Id entity 44 36. Incommensurability 45 37. Incompleteness 45 38. -
The Logic of Brouwer and Heyting
THE LOGIC OF BROUWER AND HEYTING Joan Rand Moschovakis Intuitionistic logic consists of the principles of reasoning which were used in- formally by L. E. J. Brouwer, formalized by A. Heyting (also partially by V. Glivenko), interpreted by A. Kolmogorov, and studied by G. Gentzen and K. G¨odel during the first third of the twentieth century. Formally, intuitionistic first- order predicate logic is a proper subsystem of classical logic, obtained by replacing the law of excluded middle A ∨¬A by ¬A ⊃ (A ⊃ B); it has infinitely many dis- tinct consistent axiomatic extensions, each necessarily contained in classical logic (which is axiomatically complete). However, intuitionistic second-order logic is inconsistent with classical second-order logic. In terms of expressibility, the intu- itionistic logic and language are richer than the classical; as G¨odel and Gentzen showed, classical first-order arithmetic can be faithfully translated into the nega- tive fragment of intuitionistic arithmetic, establishing proof-theoretical equivalence and clarifying the distinction between the classical and constructive consequences of mathematical axioms. The logic of Brouwer and Heyting is effective. The conclusion of an intuitionistic derivation holds with the same degree of constructivity as the premises. Any proof of a disjunction of two statements can be effectively transformed into a proof of one of the disjuncts, while any proof of an existential statement contains an effec- tive prescription for finding a witness. The negation of a statement is interpreted as asserting that the statement is not merely false but absurd, i.e., leads to a contradiction. Brouwer objected to the general law of excluded middle as claim- ing a priori that every mathematical problem has a solution, and to the general law ¬¬A ⊃ A of double negation as asserting that every consistent mathematical statement holds. -
Finite Type Arithmetic
Finite Type Arithmetic Computable Existence Analysed by Modified Realisability and Functional Interpretation H Klaus Frovin Jørgensen Master’s Thesis, March 19, 2001 Supervisors: Ulrich Kohlenbach and Stig Andur Pedersen Departments of Mathematics and Philosohy University of Roskilde Abstract in English and Danish Motivated by David Hilbert’s program and philosophy of mathematics we give in the context of natural deduction an introduction to the Dialectica interpretation and compare the interpre- tation with modified realisability. We show how the interpretations represent two structurally different methods for unwinding computable information from proofs which may use certain prima facie non-constructive (ideal) elements of mathematics. Consequently, the two inter- pretations also represent different views on what is to be regarded as constructive relative to arithmetic. The differences show up in the interpretations of extensionality, Markov’s prin- ciple and restricted forms of independence-of-premise. We show that it is computationally a subtle issue to combine these ideal elements and prove that Markov’s principle is computa- tionally incompatible with independence-of-premise for negated purely universal formulas. In the context of extracting computational content from proofs in typed classical arith- metic we also compare in an extensional context (i) the method provided by negative trans- lation + Dialectica interpretation with (ii) the method provided by negative translation + ω A-translation + modified realisability. None of these methods can be applied fully to E-PA , since E-HAω is not closed under Markov’s rule, whereas the method based on the Dialectica interpretation can be used if only weak extensionality is required. Finally, we present a new variant of the Dialectica interpretation in order to obtain (the well-known) existence property, disjunction property and other closure results for typed in- tuitionistic arithmetic and extensions hereof. -
Epistemic Modality, Mind, and Mathematics
Epistemic Modality, Mind, and Mathematics Hasen Khudairi June 20, 2017 c Hasen Khudairi 2017, 2020 All rights reserved. 1 Abstract This book concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as con- cerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality relates to the compu- tational theory of mind; metaphysical modality; deontic modality; the types of mathematical modality; to the epistemic status of undecidable proposi- tions and abstraction principles in the philosophy of mathematics; to the apriori-aposteriori distinction; to the modal profile of rational propositional intuition; and to the types of intention, when the latter is interpreted as a modal mental state. Each essay is informed by either epistemic logic, modal and cylindric algebra or coalgebra, intensional semantics or hyperin- tensional semantics. The book’s original contributions include theories of: (i) epistemic modal algebras and coalgebras; (ii) cognitivism about epistemic modality; (iii) two-dimensional truthmaker semantics, and interpretations thereof; (iv) the ground-theoretic ontology of consciousness; (v) fixed-points in vagueness; (vi) the modal foundations of mathematical platonism; (vii) a solution to the Julius Caesar problem based on metaphysical definitions availing of notions of ground and essence; (viii) the application of epistemic two-dimensional semantics to the epistemology of mathematics; and (ix) a modal logic for rational intuition. I develop, further, a novel approach to conditions of self-knowledge in the setting of the modal µ-calculus, as well as novel epistemicist solutions to Curry’s and the liar paradoxes. -
Logic Programming in a Fragment of Intuitionistic Linear Logic ∗
Logic Programming in a Fragment of Intuitionistic Linear Logic ¤ Joshua S. Hodas Dale Miller Computer Science Department Computer Science Department Harvey Mudd College University of Pennsylvania Claremont, CA 91711-5990 USA Philadelphia, PA 19104-6389 USA [email protected] [email protected] Abstract When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ [ fDg. Thus during the bottom-up search for a cut-free proof contexts, represented as the left-hand side of intuitionistic sequents, grow as stacks. While such an intuitionistic notion of context provides for elegant specifications of many computations, contexts can be made more expressive and flexible if they are based on linear logic. After presenting two equivalent formulations of a fragment of linear logic, we show that the fragment has a goal-directed interpretation, thereby partially justifying calling it a logic programming language. Logic programs based on the intuitionistic theory of hereditary Harrop formulas can be modularly embedded into this linear logic setting. Programming examples taken from theorem proving, natural language parsing, and data base programming are presented: each example requires a linear, rather than intuitionistic, notion of context to be modeled adequately. An interpreter for this logic programming language must address the problem of splitting contexts; that is, when attempting to prove a multiplicative conjunction (tensor), say G1 G2, from the context ∆, the latter must be split into disjoint contexts ∆1 and ∆2 for which G1 follows from ∆1 and G2 follows from ∆2. -
The Consistency of Arithmetic
The Consistency of Arithmetic Timothy Y. Chow July 11, 2018 In 2010, Vladimir Voevodsky, a Fields Medalist and a professor at the Insti- tute for Advanced Study, gave a lecture entitled, “What If Current Foundations of Mathematics Are Inconsistent?” Voevodsky invited the audience to consider seriously the possibility that first-order Peano arithmetic (or PA for short) was inconsistent. He briefly discussed two of the standard proofs of the consistency of PA (about which we will say more later), and explained why he did not find either of them convincing. He then said that he was seriously suspicious that an inconsistency in PA might someday be found. About one year later, Voevodsky might have felt vindicated when Edward Nelson, a professor of mathematics at Princeton University, announced that he had a proof not only that PA was inconsistent, but that a small fragment of primitive recursive arithmetic (PRA)—a system that is widely regarded as implementing a very modest and “safe” subset of mathematical reasoning—was inconsistent [11]. However, a fatal error in his proof was soon detected by Daniel Tausk and (independently) Terence Tao. Nelson withdrew his claim, remarking that the consistency of PA remained “an open problem.” For mathematicians without much training in formal logic, these claims by Voevodsky and Nelson may seem bewildering. While the consistency of some axioms of infinite set theory might be debatable, is the consistency of PA really “an open problem,” as Nelson claimed? Are the existing proofs of the con- sistency of PA suspect, as Voevodsky claimed? If so, does this mean that we cannot be sure that even basic mathematical reasoning is consistent? This article is an expanded version of an answer that I posted on the Math- Overflow website in response to the question, “Is PA consistent? do we know arXiv:1807.05641v1 [math.LO] 16 Jul 2018 it?” Since the question of the consistency of PA seems to come up repeat- edly, and continues to generate confusion, a more extended discussion seems worthwhile. -
Subverting the Classical Picture: (Co)Algebra, Constructivity and Modalities∗
Informatik 8, FAU Erlangen-Nürnberg [email protected] Subverting the Classical Picture: (Co)algebra, Constructivity and Modalities∗ Tadeusz Litak Contents 1. Subverting the Classical Picture 2 2. Beyond Frege and Russell: Modalities Instead of Predicates 6 3. Beyond Peirce, Tarski and Kripke: Coalgebras and CPL 11 3.1. Introduction to the Coalgebraic Framework ............. 11 3.2. Coalgebraic Predicate Logic ...................... 14 4. Beyond Cantor: Effectivity, Computability and Determinacy 16 4.1. Finite vs. Classical Model Theory: The Case of CPL ........ 17 4.2. Effectivity, Choice and Determinacy in Formal Economics ..... 19 4.3. Quasiconstructivity and Modal Logic ................. 21 5. Beyond Scott, Montague and Moss: Algebras and Possibilities 23 5.1. Dual Algebras, Neighbourhood Frames and CA-baes ........ 23 5.2. A Hierachy of (In)completeness Notions for Normal Modal Logics . 24 5.3. Possibility Semantics and Complete Additivity ........... 26 5.4. GQM: One Modal Logic to Rule Them All? ............. 28 6. Beyond Boole and Lewis: Intuitionistic Modal Logic 30 6.1. Curry-Howard Correspondence, Constructive Logic and 2 ..... 31 6.2. Guarded Recursion and Its Neighbours ................ 33 6.3. KM, mHC, LC and the Topos of Trees ................ 34 6.4. Between Boole and Heyting: Negative Translations ......... 35 7. Unifying Lewis and Brouwer 37 7.1. Constructive Strict Implication .................... 37 7.2. Relevance, Resources and (G)BI .................... 40 ∗Introductory overview chapter for my cumulative habilitation thesis as required by FAU Erlangen-Nürnberg regulations (submitted in 2018, finally approved in May 2019). Available online at https://www8.cs.fau. de/ext/litak/gitpipe/tadeusz_habilitation.pdf. 1 8. Beyond Brouwer, Heyting and Kolmogorov: Nondistributivity 43 8.1. -
Starting the Dismantling of Classical Mathematics
Australasian Journal of Logic Starting the Dismantling of Classical Mathematics Ross T. Brady La Trobe University Melbourne, Australia [email protected] Dedicated to Richard Routley/Sylvan, on the occasion of the 20th anniversary of his untimely death. 1 Introduction Richard Sylvan (n´eRoutley) has been the greatest influence on my career in logic. We met at the University of New England in 1966, when I was a Master's student and he was one of my lecturers in the M.A. course in Formal Logic. He was an inspirational leader, who thought his own thoughts and was not afraid to speak his mind. I hold him in the highest regard. He was very critical of the standard Anglo-American way of doing logic, the so-called classical logic, which can be seen in everything he wrote. One of his many critical comments was: “G¨odel's(First) Theorem would not be provable using a decent logic". This contribution, written to honour him and his works, will examine this point among some others. Hilbert referred to non-constructive set theory based on classical logic as \Cantor's paradise". In this historical setting, the constructive logic and mathematics concerned was that of intuitionism. (The Preface of Mendelson [2010] refers to this.) We wish to start the process of dismantling this classi- cal paradise, and more generally classical mathematics. Our starting point will be the various diagonal-style arguments, where we examine whether the Law of Excluded Middle (LEM) is implicitly used in carrying them out. This will include the proof of G¨odel'sFirst Theorem, and also the proof of the undecidability of Turing's Halting Problem. -
Relevant and Substructural Logics
Relevant and Substructural Logics GREG RESTALL∗ PHILOSOPHY DEPARTMENT, MACQUARIE UNIVERSITY [email protected] June 23, 2001 http://www.phil.mq.edu.au/staff/grestall/ Abstract: This is a history of relevant and substructural logics, written for the Hand- book of the History and Philosophy of Logic, edited by Dov Gabbay and John Woods.1 1 Introduction Logics tend to be viewed of in one of two ways — with an eye to proofs, or with an eye to models.2 Relevant and substructural logics are no different: you can focus on notions of proof, inference rules and structural features of deduction in these logics, or you can focus on interpretations of the language in other structures. This essay is structured around the bifurcation between proofs and mod- els: The first section discusses Proof Theory of relevant and substructural log- ics, and the second covers the Model Theory of these logics. This order is a natural one for a history of relevant and substructural logics, because much of the initial work — especially in the Anderson–Belnap tradition of relevant logics — started by developing proof theory. The model theory of relevant logic came some time later. As we will see, Dunn's algebraic models [76, 77] Urquhart's operational semantics [267, 268] and Routley and Meyer's rela- tional semantics [239, 240, 241] arrived decades after the initial burst of ac- tivity from Alan Anderson and Nuel Belnap. The same goes for work on the Lambek calculus: although inspired by a very particular application in lin- guistic typing, it was developed first proof-theoretically, and only later did model theory come to the fore. -
From Axioms to Rules — a Coalition of Fuzzy, Linear and Substructural Logics
From Axioms to Rules — A Coalition of Fuzzy, Linear and Substructural Logics Kazushige Terui National Institute of Informatics, Tokyo Laboratoire d’Informatique de Paris Nord (Joint work with Agata Ciabattoni and Nikolaos Galatos) Genova, 21/02/08 – p.1/?? Parties in Nonclassical Logics Modal Logics Default Logic Intermediate Logics (Padova) Basic Logic Paraconsistent Logic Linear Logic Fuzzy Logics Substructural Logics Genova, 21/02/08 – p.2/?? Parties in Nonclassical Logics Modal Logics Default Logic Intermediate Logics (Padova) Basic Logic Paraconsistent Logic Linear Logic Fuzzy Logics Substructural Logics Our aim: Fruitful coalition of the 3 parties Genova, 21/02/08 – p.2/?? Basic Requirements Substractural Logics: Algebraization ´µ Ä Î ´Äµ Genova, 21/02/08 – p.3/?? Basic Requirements Substractural Logics: Algebraization ´µ Ä Î ´Äµ Fuzzy Logics: Standard Completeness ´µ Ä Ã ´Äµ ¼½ Genova, 21/02/08 – p.3/?? Basic Requirements Substractural Logics: Algebraization ´µ Ä Î ´Äµ Fuzzy Logics: Standard Completeness ´µ Ä Ã ´Äµ ¼½ Linear Logic: Cut Elimination Genova, 21/02/08 – p.3/?? Basic Requirements Substractural Logics: Algebraization ´µ Ä Î ´Äµ Fuzzy Logics: Standard Completeness ´µ Ä Ã ´Äµ ¼½ Linear Logic: Cut Elimination A logic without cut elimination is like a car without engine (J.-Y. Girard) Genova, 21/02/08 – p.3/?? Outcome We classify axioms in Substructural and Fuzzy Logics according to the Substructural Hierarchy, which is defined based on Polarity (Linear Logic). Genova, 21/02/08 – p.4/?? Outcome We classify axioms in Substructural and Fuzzy Logics according to the Substructural Hierarchy, which is defined based on Polarity (Linear Logic). Give an automatic procedure to transform axioms up to level ¼ È È ¿ ( , in the absense of Weakening) into Hyperstructural ¿ Rules in Hypersequent Calculus (Fuzzy Logics).