Paraconsistent Intuitionistic Logic Hans Lycke Centre for Logic and - PowerPoint PPT Presentation

FACULTY OF ARTS AND PHILOSOPHY Paraconsistent Intuitionistic Logic Hans Lycke Centre for Logic and Philosophy of Science Ghent University Hans.Lycke@Ugent.be http://logica.ugent.be/hans UNILOG 2010 April 22–25 2010, Estoril

Outline Introduction 1 Standard Intuitionistic Negation Aim of this talk Paraconsistent Intuitionistic Logic 2 Main Idea Language Schema Proof Theory Semantics Advantages and Disadvantages Inconsistency–Adaptive Intuitionistic Logic 3 Main Idea General Characterization Semantics Proof Theory Conclusion 4 H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 2 / 36

Introduction Standard Intuitionistic Negation Intuitionist Negation: Intuitive Interpretation “ ¬ p can be asserted if and only if we possess a construction which from the supposition that a construction p were carried out, leads to a contradiction.” (Heyting, 1956, p. 98) H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 4 / 36

Introduction Standard Intuitionistic Negation Intuitionist Negation: Intuitive Interpretation “ ¬ p can be asserted if and only if we possess a construction which from the supposition that a construction p were carried out, leads to a contradiction.” (Heyting, 1956, p. 98) Intuitionist Negation: Proof Theoretic Interpretation In intuitionistic logic INT , negation is characterized by the axiom schemas RED (reductio) and EFQ (ex falso quodlibet). RED ( A ⊃ ¬ A ) ⊃ ¬ A A ⊃ ( ¬ A ⊃ B ) EFQ H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 4 / 36

Introduction Standard Intuitionistic Negation Intuitionist Negation: Intuitive Interpretation “ ¬ p can be asserted if and only if we possess a construction which from the supposition that a construction p were carried out, leads to a contradiction.” (Heyting, 1956, p. 98) Intuitionist Negation: Proof Theoretic Interpretation In intuitionistic logic INT , negation is characterized by the axiom schemas RED (reductio) and EFQ (ex falso quodlibet). RED ( A ⊃ ¬ A ) ⊃ ¬ A A ⊃ ( ¬ A ⊃ B ) EFQ Clash of the Interpretations! In view of the intuitive interpretation of intuitionisitic negation, it is hard to see why the logic INT validates the inference rule EFQ . F OR The construction of a contradiction doesn’t guarantee the construction of any formula whatsoever. H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 4 / 36

Introduction Standard Intuitionistic Negation Heyting’s Answer “Now suppose that ⊢ ¬ p, that is, we have deduced a contradiction from the supposition that p were carried out. Then, in a sense, this can be considered as a construction, which joined to a proof of p (which cannot exist) leads to a proof of q.” (Heyting, 1956, p. 102) H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 5 / 36

Introduction Standard Intuitionistic Negation Heyting’s Answer “Now suppose that ⊢ ¬ p, that is, we have deduced a contradiction from the supposition that p were carried out. Then, in a sense, this can be considered as a construction, which joined to a proof of p (which cannot exist) leads to a proof of q.” (Heyting, 1956, p. 102) There are no constructions for contradictions! I MPLIES H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 5 / 36

Introduction Standard Intuitionistic Negation Heyting’s Answer “Now suppose that ⊢ ¬ p, that is, we have deduced a contradiction from the supposition that p were carried out. Then, in a sense, this can be considered as a construction, which joined to a proof of p (which cannot exist) leads to a proof of q.” (Heyting, 1956, p. 102) There are no constructions for contradictions! I MPLIES H OWEVER This has been refuted time and again by the history of scientific practice. F OR People seem to find it quite difficult to come up with theories that do not contain contradictions, which is only possible if these theories contain constructions for those contradictions. H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 5 / 36

Introduction Standard Intuitionistic Negation The Normative Answer A theory should not contain constructions for contradictions! H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 6 / 36

Introduction Standard Intuitionistic Negation The Normative Answer A theory should not contain constructions for contradictions! B UT I agree! H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 6 / 36

Introduction Standard Intuitionistic Negation The Normative Answer A theory should not contain constructions for contradictions! B UT I agree! H OWEVER The present inconsistent theories have to be put to use as long as no consistent replacement theories have been constructed. ⇒ It is necessary to cope efficiently with the theories at hand! H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 6 / 36

Introduction Aim of this talk A Twofold Aim To present a version of intuitionistic logic H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 8 / 36

Introduction Aim of this talk A Twofold Aim To present a version of intuitionistic logic that can efficiently cope with inconsistent theories, and that captures the intuitive meaning of intuitionistic negation. H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 8 / 36

Introduction Aim of this talk A Twofold Aim To present a version of intuitionistic logic that can efficiently cope with inconsistent theories, and that captures the intuitive meaning of intuitionistic negation. ⇒ I will do so by relying on the adaptive logics approach — based on Batens (2001,2007,201x) and Lycke (201x). H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 8 / 36

Paraconsistent Intuitionistic Logic Main Idea First Proposal The overall rejection of the axiom schema EFQ . H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 10 / 36

Paraconsistent Intuitionistic Logic Main Idea First Proposal The overall rejection of the axiom schema EFQ . ⇒ The logic INTuN (intuitionistic logic with gluts for negation). H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 10 / 36

Paraconsistent Intuitionistic Logic The Logic INTuN : Language Schema Preliminary Remark For reasons of simplicity, I here limit myself to the propositional case! H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 12 / 36

Paraconsistent Intuitionistic Logic The Logic INTuN : Language Schema Preliminary Remark For reasons of simplicity, I here limit myself to the propositional case! The Language Schema(s) of INTuN Language Letters Logical Symbols Well–Formed Formulas L S ∼ , ∧ , ∨ , ⊃ W L ⊥ S , ⊥ ∼ , ∧ , ∨ , ⊃ W ⊥ H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 12 / 36

Paraconsistent Intuitionistic Logic The Logic INTuN : Language Schema Preliminary Remark For reasons of simplicity, I here limit myself to the propositional case! The Language Schema(s) of INTuN Language Letters Logical Symbols Well–Formed Formulas L S ∼ , ∧ , ∨ , ⊃ W L ⊥ S , ⊥ ∼ , ∧ , ∨ , ⊃ W ⊥ The Negation Set N N = {∼ A | A ∈ W} . H. Lycke (Ghent University) Paraconsistent Intuitionistic Logic UNILOG 2010, Estoril 12 / 36

Paraconsistent Intuitionistic Logic Hans Lycke Centre for Logic and - PowerPoint PPT Presentation

FACULTY OF ARTS AND PHILOSOPHY Paraconsistent Intuitionistic Logic Hans Lycke Centre for Logic and Philosophy of Science Ghent University Hans.Lycke@Ugent.be http://logica.ugent.be/hans UNILOG 2010 April 2225 2010, Estoril Outline

A Paraconsistent Sub-Logic of Intuitionistic Propositional Logic Sankha S. Basu Department of

Paraconsistent Set Theory Sourav Tarafder St. Xaviers College Kolkata Paraconsistent Logic

Paraconsistent Computational Logic Andreas Schmidt Jensen and Jrgen Villadsen Algorithms and

A paraconsistent approach to da Costas deontic logic: beyond contradictions and triviality

Correspondence with intuitionistic propositional logic This interpretation correponds exactly to

Towards Paraconsistent Games via Topologies Can BAS KENT Department of Computer Science,

Intuitionistic and Modal Logic Dick de Jongh Institute for Logic, Language and Computation

Intuitionistic modalities in topology and algebra Mamuka Jibladze Razmadze Mathematical

Logic Programming in a Fragment of Intuitionistic Linear Logic by Joshua Hodas , PhD student at

Quantifiers and Functions in Intuitionistic Logic Association for Symbolic Logic Spring Meeting

Using Intuitionistic Logic as a basis for Legal Ontologies Edward Hermann Hausler Alexandre

On Paraconsistent Belief Revision Rafael R. Testa Centre for Logic, Epistemology and History of

Positive Intuitionistic Propositional Logic Carl Pollard Department of Linguistics Ohio State

Intuitionistic Epistemic Logic Tudor Protopopescu Higher School of Economics, Moscow Institute

Deep Inference in Bi-intuitionistic Logic Linda Postniece Logic and Computation Group College of

Admissible tools in the kitchen of intuitionistic logic Matteo Manighetti 1 Andrea Condoluci 2

Quantifiers and Functions in Intuitionistic Logic Collegium Logicum Proof Theory: Herbrands

Paraconsistent Relational Model: A Quasi-Classic Logic Approach 1 Authors: Badrinath Jayakumar*

Tableau Theorem Prover for Intuitionistic Propositional Logic Larry Diehl Portland State

Tableau Theorem Prover for Intuitionistic Propositional Logic Larry Diehl Portland State

Intuitionistic Description Logic and Legal Reasoning Edward Hermann Hausler Valeria de Paiva

The rules of constructive reasoning Rosalie Iemhoff Utrecht University 1 / 31 Intuitionistic

From Display Calculi to Decision Procedures for Full Intuitionistic Linear Logic Ranald Clouston,

Cut-elimination for Intuitionistic Provability Logic Iris van der Giessen Utrecht University