CONSTRUCTIVE TYPE THEORY and the DIALOGICAL Rules for Dialectical Games Presented in the Topics (Θ, 2, 157A 34 and 3 APPROACH to MEANING 8,160B)
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Contextual Epistemic Logic Manuel Rebuschi, Franck Lihoreau
Contextual Epistemic Logic Manuel Rebuschi, Franck Lihoreau To cite this version: Manuel Rebuschi, Franck Lihoreau. Contextual Epistemic Logic. C. Degrémont, L. Keiff & H. Rückert. Dialogues, Logics and Other Strange Things. Essays in Honour of Shahid Rahman, King’s College Publication, pp.305-335, 2008, Tributes. hal-00133359 HAL Id: hal-00133359 https://hal.archives-ouvertes.fr/hal-00133359 Submitted on 11 Jan 2009 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Contextual Epistemic Logic Manuel Rebuschi Franck Lihoreau L.H.S.P. – Archives H. Poincar´e Instituto de Filosofia da Linguagem Universit´eNancy 2 Universidade Nova de Lisboa [email protected] [email protected] Abstract One of the highlights of recent informal epistemology is its growing theoretical emphasis upon various notions of context. The present paper addresses the connections between knowledge and context within a formal approach. To this end, a “contextual epistemic logic”, CEL, is proposed, which consists of an extension of standard S5 epistemic modal logic with appropriate reduction axioms to deal with an extra contextual operator. We describe the axiomatics and supply both a Kripkean and a dialogical semantics for CEL. -
Implicit Versus Explicit Knowledge in Dialogical Logic Manuel Rebuschi
Implicit versus Explicit Knowledge in Dialogical Logic Manuel Rebuschi To cite this version: Manuel Rebuschi. Implicit versus Explicit Knowledge in Dialogical Logic. Ondrej Majer, Ahti-Veikko Pietarinen and Tero Tulenheimo. Games: Unifying Logic, Language, and Philosophy, Springer, pp.229-246, 2009, 10.1007/978-1-4020-9374-6_10. halshs-00556250 HAL Id: halshs-00556250 https://halshs.archives-ouvertes.fr/halshs-00556250 Submitted on 16 Jan 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Implicit versus Explicit Knowledge in Dialogical Logic Manuel Rebuschi L.P.H.S. – Archives H. Poincar´e Universit´ede Nancy 2 [email protected] [The final version of this paper is published in: O. Majer et al. (eds.), Games: Unifying Logic, Language, and Philosophy, Dordrecht, Springer, 2009, 229-246.] Abstract A dialogical version of (modal) epistemic logic is outlined, with an intuitionistic variant. Another version of dialogical epistemic logic is then provided by means of the S4 mapping of intuitionistic logic. Both systems cast new light on the relationship between intuitionism, modal logic and dialogical games. Introduction Two main approaches to knowledge in logic can be distinguished [1]. The first one is an implicit way of encoding knowledge and consists in an epistemic interpretation of usual logic. -
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). -
Bunched Hypersequent Calculi for Distributive Substructural Logics
EPiC Series in Computing Volume 46, 2017, Pages 417{434 LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning Bunched Hypersequent Calculi for Distributive Substructural Logics Agata Ciabattoni and Revantha Ramanayake Technische Universit¨atWien, Austria fagata,[email protected]∗ Abstract We introduce a new proof-theoretic framework which enhances the expressive power of bunched sequents by extending them with a hypersequent structure. A general cut- elimination theorem that applies to bunched hypersequent calculi satisfying general rule conditions is then proved. We adapt the methods of transforming axioms into rules to provide cutfree bunched hypersequent calculi for a large class of logics extending the dis- tributive commutative Full Lambek calculus DFLe and Bunched Implication logic BI. The methodology is then used to formulate new logics equipped with a cutfree calculus in the vicinity of Boolean BI. 1 Introduction The wide applicability of logical methods and their use in new subject areas has resulted in an explosion of new logics. The usefulness of these logics often depends on the availability of an analytic proof calculus (formal proof system), as this provides a natural starting point for investi- gating metalogical properties such as decidability, complexity, interpolation and conservativity, for developing automated deduction procedures, and for establishing semantic properties like standard completeness [26]. A calculus is analytic when every derivation (formal proof) in the calculus has the property that every formula occurring in the derivation is a subformula of the formula that is ultimately proved (i.e. the subformula property). The use of an analytic proof calculus tremendously restricts the set of possible derivations of a given statement to deriva- tions with a discernible structure (in certain cases this set may even be finite). -
Applications of Non-Classical Logic Andrew Tedder University of Connecticut - Storrs, [email protected]
University of Connecticut OpenCommons@UConn Doctoral Dissertations University of Connecticut Graduate School 8-8-2018 Applications of Non-Classical Logic Andrew Tedder University of Connecticut - Storrs, [email protected] Follow this and additional works at: https://opencommons.uconn.edu/dissertations Recommended Citation Tedder, Andrew, "Applications of Non-Classical Logic" (2018). Doctoral Dissertations. 1930. https://opencommons.uconn.edu/dissertations/1930 Applications of Non-Classical Logic Andrew Tedder University of Connecticut, 2018 ABSTRACT This dissertation is composed of three projects applying non-classical logic to problems in history of philosophy and philosophy of logic. The main component concerns Descartes’ Creation Doctrine (CD) – the doctrine that while truths concerning the essences of objects (eternal truths) are necessary, God had vol- untary control over their creation, and thus could have made them false. First, I show a flaw in a standard argument for two interpretations of CD. This argument, stated in terms of non-normal modal logics, involves a set of premises which lead to a conclusion which Descartes explicitly rejects. Following this, I develop a multimodal account of CD, ac- cording to which Descartes is committed to two kinds of modality, and that the apparent contradiction resulting from CD is the result of an ambiguity. Finally, I begin to develop two modal logics capturing the key ideas in the multi-modal interpretation, and provide some metatheoretic results concerning these logics which shore up some of my interpretive claims. The second component is a project concerning the Channel Theoretic interpretation of the ternary relation semantics of relevant and substructural logics. Following Barwise, I de- velop a representation of Channel Composition, and prove that extending the implication- conjunction fragment of B by composite channels is conservative. -
Inferential Semantics As Argumentative Dialogues Davide Catta, Luc Pellissier, Christian Retoré
Inferential Semantics as Argumentative Dialogues Davide Catta, Luc Pellissier, Christian Retoré To cite this version: Davide Catta, Luc Pellissier, Christian Retoré. Inferential Semantics as Argumentative Dialogues. DCAI 2020 - 17th International Conference on Distributed Computing and Artificial Intelligence, Jun 2020, L´Aquila, Italy. pp.72-81, 10.1007/978-3-030-53829-3_7. hal-02922646 HAL Id: hal-02922646 https://hal.archives-ouvertes.fr/hal-02922646 Submitted on 26 Aug 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Inferential Semantics as Argumentative Dialogues Davide Catta1, Luc Pellissier2, and Christian Retor´e1 1 LIRMM, Univ Montpellier, CNRS, Montpellier [email protected], [email protected] 2 Partout, INRIA Saclay ^Ile de France [email protected] Abstract. This paper is at the same time a first step towards an \im- plementation" of the inferentialist view of meaning and a first proposal for a logical structure which describes an argumentation. According to inferentialism the meaning of a statement lies in its argumentative use, its justifications, its refutations and more generally its deductive rela- tion to other statements. In this first step we design a simple notion of argumentative dialogue. -
Arguing Ecosystem Values with Paraconsistent Logics
Arguing Ecosystem Values with Paraconsistent Logics Juan Afanador University of Edinburgh November 18, 2019 Abstract The valuation of ecosystem services prompts dialogical settings where non-trivially incon- sistent arguments are often invoked. Here, I propose an approach to the valuation of ecosystem services circumscribed to a logic-based argumentation framework that caters for valid inconsis- tencies. This framework accounts for preference formation processes underpinned by a paracon- sistent model of logical entailment. The value of an ecosystem service is produced in the form of an ordering over competing land-use practices, as per the arguments surviving semantical probing. Keywords: valuation of ecosystem services, abstract argumentation, paraconsistent logics, Dialetheism. 1 Introduction The valuation of ecosystem services deals with distinct and contradictory views on value, a mul- tiplicity that typically reflects opposing or conflicting land-use practices. At times, it is the case that the same people who acknowledge the importance of the benefits derived from a particular ecosystem function, and who are also aware of the connection between the two, undertake actions that contravene the precedence of such knowledge. Furthermore, these decisions are not made in the abstract, but mediated by various forms of sociality involving dialogue —even if only implicitly. This document presents an approach to the valuation of ecosystem services that incorporates the contradictions and inconsistencies inherent in valuation —an approach I term Argumentative arXiv:1911.06367v1 [cs.LO] 14 Nov 2019 Valuation (AV). AV relies on an argumentation framework structured around Dialetheism. AV’s argumentation framework enables the dialogical settings where values substantiate, while its di- aletheic substrate allows for true (truthful) inconsistencies in the values’ antecedents. -
Chu's Construction
Chu's construction: A proof-theoretic approach revisited G. Bellin October 1, 2015 Abstract The paper Chu's construction: A proof-theoretic approach (Bellin 2003) relates the proof-theoretic question about the meaning of Girard's long trips condition for proof nets to research (Hyland and Schalk 2003) on abstract structures with self-duality related to game-semantics, namely, dialectica categories (De Paiva 1991) and Chu's construction (Barr 1979). We consider an informal interpretation inspired by htis result, assuming that the role of player and opponent in a dialogue may involve different illocutionary forces (question / answer, assertion/ doubt). We ask how this relates to other game theoretic or dialogical interpretations. Simple self-duality and the long trip condition. The abstract of (Bellin 2003) says: "The essential interaction between classical and intuitionistic features in the system of linear logic is best described in the language of category theory. Given a symmetric monoidal closed category C with finite products, the category C × Cop can be given the structure of a ∗-autonomous category by a special case of the Chu construction. Girard's trips induce translations of classical MLL− proof net into intuitionistic proof in IMLL− and these translations determine the functor from the free ∗-autonomous op category A on a set of atoms fP1; P2;:::g to C × C , where C is the free monoidal closed category with products and coproducts on 0 0 0 the set of atoms fP1; P1; P2; P2;:::g (a pair P, P in C for each atom P of A)." 1. CMLL: Classical Multiplicative Linear Logic Language of CMLL: A; B := P j P? j 1 j ? j A ⊗ B j A}B in negation normal form: 1? = ?; (A ⊗ B)? = (A?}B?), etc. -
Homotopy Type-Theoretic Interpretations of Constructive Set Theories
Homotopy Type-Theoretic Interpretations of Constructive Set Theories Cesare Gallozzi Submitted in accordance with the requirements for the degree of Doctor of Philosophy The University of Leeds School of Mathematics July 2018 The candidate confirms that the work submitted is his own and that appropriate credit has been given where reference has been made to the work of others. This copy has been supplied on the understanding that it is copyright material and that no quotation from the thesis may be published without proper acknowledge- ment. c 2018, The University of Leeds and Cesare Gallozzi The right of Cesare Gallozzi to be identified as author of this work has been asserted by him in accordance with the Copyright, Designs and Patents Act 1988. To all my teachers. Acknowledgements I wish to thank all those who made this thesis possible. I thank all my teachers and in particular my supervisor Nicola Gambino for his tireless generosity and all the help and guidance he offered during the course of the PhD. I thank the University of Leeds and the School of Mathematics for their financial support. I thank all those who contributed to improve this thesis by answering my ques- tions or making comments on the material: my co-supervisor Michael Rathjen, and also Peter Hancock, John Truss, Stan Wainer, Martin Hofmann, Helmut Schwichtenberg, Michael Toppel, Anton Freund, Andrew Swan, Jakob Vidmar, Nicolai Kraus and Fredrik Nordvall Forsberg. I thank my parents and my grandmother for all their care and for encouraging my interests in science and mathematics since my early childhood. -
Argumentation Theory Vs Formal Logic: the Case of Scientific Argumentation and the 'Logic' of Controversies
INTERNATIONAL COLLOQUIUM INSIDE ARGUMENTS LOGIC vs ARGUMENTATION THEORY Faculty of Letters of the University of Coimbra (Portugal) March 24-26, 2011 __________________________ ABSTRACTS (alphabetical order) _________________ 1 A Little Light Logic Alec Fisher University of East Anglia, Norwich, UK As a student, in the 1960s, I trained as a philosopher and mathematical logician. When I began teaching philosophy and logic I had a shock―which was that teaching logic didn‟t help my students to be more logical (teaching philosophy didn‟t seem to help either). So I began to work on ways of helping students become more logical and reasonable. This was a relatively novel idea in the 1970s and it lead first to the publication of The Logic of Real Arguments and later to Critical Thinking: An Introduction―with various diversions into assessment issues on the way. In this, my last conference talk (!), I shall reflect on the roles of formal logic, informal logic and critical thinking in education – and on some of the mistakes I have made! Some Thoughts about Logical Form and Argument Analysis Andrei Moldovan University of Salamanca, Spain The purpose of this paper is twofold. On the one hand, it is a rejection of some arguments present in the literature against the relevance of formal logic to argument analysis and evaluation. On the other hand, it is an assessment, from the perspective of philosophy of language, of formal analysis of arguments. I claim that without having a good understanding of some fundamental concepts in philosophical semantics and pragmatics, such as logical form, implicature and presupposition, formal analyses of arguments are prone to error. -
Linear Logic and Noncommutativity in the Calculus of Structures
Linear Logic and Noncommutativity in the Calculus of Structures Dissertation zur Erlangung des akademischen Grades Doktor rerum naturalium (Dr. rer. nat.) vorgelegt an der Technischen Universit¨at Dresden Fakult¨at Informatik eingereicht am 26. Mai 2003 von Diplom-Informatiker Lutz Straßburger geboren am 21. April 1975 in Dresden Betreuer: Dr. Alessio Guglielmi Betreuender Hochschullehrer: Prof. Dr. rer. nat. habil. Steffen H¨olldobler Gutachter: Prof. Dr. rer. nat. habil. Steffen H¨olldobler Dr. Fran¸cois Lamarche Prof. Dr. rer. nat. habil. Horst Reichel Disputation am 24. Juli 2003 Acknowledgements Iamparticularlyindebted to Alessio Guglielmi. Whithout his advice and guidance this thesis would not have been written. He awoke my interest for thefascinating field of proof theory and introduced me to the calculus of structures. I benefited from many fruitful and inspiring discussions with him, and in desperate situations he encouraged me to keep going. He also provided me with his TEXmacrosfor typesetting derivations. IamgratefultoSteffenH¨olldobler for accepting the supervision of this thesis and for providing ideal conditions for doing research. He also made many helpful suggestions forimproving the readability. I am obliged to Fran¸cois Lamarche and Horst Reichel for accepting to be referees. Iwouldlike to thank Kai Br¨unnler, Paola Bruscoli, Charles Stewart, and Alwen Tiu for many fruitful discussion during the last three years. In particular, I am thankful to Kai Br¨unnler for struggling himself through a preliminary version and making helpful comments. Jim Lipton and Charles Stewart made valuable suggestions for improving the introduction. Additionally, I would like to thank Claus J¨urgensen for the fun we had in discussing TEXmacros.Inparticular, the (self-explanatory) macro \clap,whichisused on almost every page, came out of such a discussion.