Outline. 1 Background and Aim. 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion

Similar documents
Classical and Empirical Negation in Subintuitionistic Logic

More on Empirical Negation

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

Empirical Negation. Michael De

02 Propositional Logic

MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC

Module 5 K and Equivalent Systems

CHAPTER 11. Introduction to Intuitionistic Logic

KLEENE LOGIC AND INFERENCE

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1

Learning Goals of CS245 Logic and Computation

Classical Propositional Logic

Modal logics: an introduction

Propositional Logic Language

First-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig

An Introduction to Modal Logic V

A Remark on Propositional Kripke Frames Sound for Intuitionistic Logic

185.A09 Advanced Mathematical Logic

Relevant Logic. Daniel Bonevac. March 20, 2013

Developing Modal Tableaux and Resolution Methods via First-Order Resolution

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models

Peano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now

Lecture 11: Measuring the Complexity of Proofs

Preface to the First Edition. xxvii 0.1 Set-theoretic Notation xxvii 0.2 Proof by Induction xxix 0.3 Equivalence Relations and Equivalence Classes xxx

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

An Introduction to Modal Logic III

A generalization of modal definability

Deductive Systems. Lecture - 3

Kamila BENDOVÁ INTERPOLATION AND THREE-VALUED LOGICS

Nonclassical logics (Nichtklassische Logiken)

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

Dynamic Epistemic Logic Displayed

RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED LOGIC

On Jankov-de Jongh formulas

Arrows and Boxes. Tadeusz Litak (based on a joint work with Albert Visser) November 15, 2016

Propositional Logic: Part II - Syntax & Proofs 0-0

Logic: Propositional Logic (Part I)

Logic for Computer Science - Week 4 Natural Deduction

Subminimal Negation. Almudena Colacito, Dick de Jongh and Ana Lucia Vargas. March 30, 2016

Propositions and Proofs

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic

From Syllogism to Common Sense

INF3170 Logikk Spring Homework #8 For Friday, March 18

Propositional Logics and their Algebraic Equivalents

Subminimal Logics and Relativistic Negation

Semantical study of intuitionistic modal logics

Introduction to Metalogic

Soundness Theorem for System AS1

Modal Probability Logic

Logic and Discrete Mathematics. Section 3.5 Propositional logical equivalence Negation of propositional formulae

Propositional Logic: Models and Proofs

Model Checking for Modal Intuitionistic Dependence Logic

Basic Algebraic Logic

Natural Deduction for Propositional Logic

Introduction to Intuitionistic Logic

Justification logic - a short introduction

Chapter 11: Automated Proof Systems (1)

1. Propositional Calculus

Propositional Reasoning

Automated Support for the Investigation of Paraconsistent and Other Logics

Propositional Logic Arguments (5A) Young W. Lim 11/8/16

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson

Decidability of Order-Based Modal Logics

Varieties of Heyting algebras and superintuitionistic logics

Informal Statement Calculus

Propositional and Predicate Logic - V

On Hájek s Fuzzy Quantifiers Probably and Many

Residuated fuzzy logics with an involutive negation

Natural deduction for propositional logic via truth tables

De Jongh s characterization of intuitionistic propositional calculus

Warm-Up Problem. Is the following true or false? 1/35

Propositional Logic Truth-functionality Definitions Soundness Completeness Inferences. Modal Logic. Daniel Bonevac.

Motivation. CS389L: Automated Logical Reasoning. Lecture 10: Overview of First-Order Theories. Signature and Axioms of First-Order Theory

AN EXTENSION OF THE PROBABILITY LOGIC LP P 2. Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2

Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008

Modal Logic XX. Yanjing Wang

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University

General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations

Krivine s Intuitionistic Proof of Classical Completeness (for countable languages)

Equivalence for the G 3-stable models semantics

A four-valued frame semantics for relevant logic

Semantics and Pragmatics of NLP

PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2

On Urquhart s C Logic

A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5

Normal Forms of Propositional Logic

Syntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.

Mat 243 Exam 1 Review

Logic: The Big Picture

Inquisitive Logic. Ivano Ciardelli.

Modal Logics. Most applications of modal logic require a refined version of basic modal logic.

Relevance Logic as an Information-Based Logic. J. Michael Dunn Indiana University Bloomington

WHAT IS THE CORRECT LOGIC OF NECESSITY, ACTUALITY AND APRIORITY?

CL16, 12th September 2016

PROPOSITIONAL MIXED LOGIC: ITS SYNTAX AND SEMANTICS

Towards Intuitionistic Dynamic Logic

RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS

Mathematics for linguists

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos

Transcription:

Outline 1 Background and Aim 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 2 / 26

Motivation for empirical negation Intuitionism: a verificationism restricted to mathematical discourse. An attempt to generalize intuitionism to empirical discourse presents various challenges. Question: will,, and suffice as propositional connectives for an empirical language? Answer: no, especially concerning negation. E.g., Dummett says: De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 4 / 26

Motivation for empirical negation (Cont d) Dummet in The seas of language (1996), p.473. Negation... is highly problematic. In mathematics, given the meaning of if... then, it is trivial to explain Not A as meaning If A, then 0 = 1 ; by contrast, a satisfactory explanation of not, as applied to empirical statements for which bivalence is not, in general, taken as holding, is very difficult to arrive at. Given that the sentential operators cannot be thought of as explained by means of the two-valued truth-tables, the possibility that the laws of classical logic will fail is evidently open: but it is far from evident that the correct logical laws will always be the intuitionistic ones. More generally, it is by no means easy to determine what should serve as the analogue, for empirical statements, of the notion of proof as it figures in intuitionist semantics for mathematical statements. De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 5 / 26

Motivation for empirical negation (Cont d) Problem The arrow-falsum definition of negation is often too strong to serve as the negation for empirical statements. Example Attempt: express in our generalized intuitionistic language the fact that Goldbach s conjecture is not decided. What we get: any warrant for Goldbach s conjecture is decided can be transformed into warrant for an absurdity (say 0=1 ). This implies that Goldbach s conjecture is undecidable! No! In the future, someone may prove or refute Goldbach s conjecture. So the fact that Goldbach s conjecture is not decided does not imply that it is undecidable, as our translation gives us. What we want: there is no sufficient evidence at present for the truth of the conjecture. De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 6 / 26

Semantics for IPC Definition (Semantics for IPC ) IPC model M is W,, @, v where W : non-empty set partially ordered by with the least element @. V : W Prop {0, 1} where if v(w 1, p) = 1 and w 1 w 2 then v(w 2, p) = 1 for all p Prop and w 1, w 2 W. Valuations V are then extended to interpretations I as follows: I (w, p) = V (w, p) I (w, A) = 1 iff I (@, A) = 0 I (w, A B) = 1 iff I (w, A) = 1 and I (w, B) = 1 I (w, A B) = 1 iff I (w, A) = 1 or I (w, B) = 1 I (w, A B) = 1 iff for all x W : if w x & I (x, A)=1 then I (x, B)=1. De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 7 / 26

Classical negation I (w, A) = 1 iff I (w, A) 1 De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 8 / 26

Subintuitionistic logic (or Logics with strict implication) Some earlier works Giovanna Corsi: Weak logics with strict implication (1987) Kosta Došen: Modal translations in K and D (1993) Greg Restall: Subintuitionistic Logic (1994) We follow Restall s presentation which accommodates our approach. De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 9 / 26

Subintuitionistic logic (due to Restall): semantics Definition (Semantics for SJ) SJ model M is W, @, R, v where W : non-empty set with @ W. R: binary relation on W with @Rw for all w W. V : W Prop {0, 1}. Valuations V are then extended to interpretations I as follows: I (w, p) = V (w, p) I (w, A B) = 1 iff I (w, A) = 1 and I (w, B) = 1 I (w, A B) = 1 iff I (w, A) = 1 or I (w, B) = 1 I (w, A B) = 1 iff for all x W : if wrx & I (x, A)=1 then I (x, B)=1. Semantic consequence is defined in terms of truth preservation at @: Σ = A iff for all models W, @, R, I, I (@, A)=1 if I (@, B)=1 for all B Σ. De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 10 / 26

Subintuitionistic logic (due to Restall): proof theory Definition (Axioms and rules of inference for SJ) A A A (B B) ((A B) (B C)) (A C) (A B) A (A B) B A A B B A C (A B) C B C ((C A) (C B)) (C (A B))) A (A B) B (A B) ((A C) (B C)) ((A B) C)) (A (B C)) ((A B) (A C)) A B A B (A B) E (C D) E ((B C) (A D)) E Γ A iff there is a sequence of formulae B 1,..., B n, A, n 0, such that every formula in the sequence B 1,..., B n, A either (i) belongs to Γ; (ii) is an axiom of SJ; (iii) is obtained by one of the rules from formulae preceding it in sequence. De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 11 / 26

Aim Previous results De: a discussion of empirical negation De & O.: an axiomatization of IPC Farinas & Herzig: combines classical and intuitionistic negations Restall: subintuitionistic logics Aim explore classical and empirical negations in subintuitionistic logic observe two more results related to empirical negation in relevant and superintuitionistic logics De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 12 / 26

Classical negation Theorem (inspired by Routley and Meyer) Subintuitionistic logic with classical negation is axiomatized by SJ plus: A A ((A B) C) D ((A C) B) D De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 14 / 26

Some basic results Deduction theorem Γ, A c B iff Γ c A B Validities (A A) B B (A A) A A (A B) ( A B) (A B) ( A B) A B B A A B B A Invalidities A ( A B) (A B) ( B A) ( B A) (A B) De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 15 / 26

Some basic results Combining classical and intuitionistic logic (1996) An attempt to combine classical and intuitionistic logics. Axiom system is formulated along the line of conditional logic. Theorem SJ with classical negation extended by axioms for reflexivity, transitivity and restricted heredity is sound and complete with respect to C+J-models. De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 16 / 26

Empirical negation Theorem Subintuitionistic logic with empirical negation is axiomatized by SJ plus: A A A ( A B) A (B A) ( A B) (A B) (A B) C ( A B) C Remark IPC is axiomatized by IPC + plus: A A A ( A B) A B A B Remark Addition of empirical negation implies the loss of disjunctive property. De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 17 / 26

Some results Deduction theorem Γ, A e B iff Γ e A B Corollary Γ, A e B iff Γ e A B iff Γ e B A Validities and invalidities e A ( A B) but A, A e B e A A but A e A e A A but A e A (A B) ( A B) (A B) ( A B) De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 18 / 26

Below subintuitionistic logic Theorem (Routley and Priest) SJ minus B (A A) ((A B) (B C)) (A C) is sound and complete wrt simplified semantics. Question Can we add empirical negation to weak relevant logics? De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 20 / 26

Below subintuitionistic logic Theorem B + with empirical negation can be axiomatized by adding the following: A A A ( A B) A (B A) ( A B) (A B) (A B) C ( A B) C Remark Even if we lose B (A A), we still have (A A) B. Classical negation can be added too! De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 21 / 26

Beyond intuitionistic logic Definition (Semantics for G ) G model M is W,, @, v where W : non-empty set linearly ordered by with the least element @. V : W Prop {0, 1} where if v(w 1, p) = 1 and w 1 w 2 then v(w 2, p) = 1 for all p Prop and w 1, w 2 W. Valuations V are then extended to interpretations I as follows: I (w, p) = V (w, p) I (w, A) = 1 iff I (@, A) = 0 I (w, A B) = 1 iff I (w, A) = 1 and I (w, B) = 1 I (w, A B) = 1 iff I (w, A) = 1 or I (w, B) = 1 I (w, A B) = 1 iff for all x W : if w x & I (x, A)=1 then I (x, B)=1. Semantic consequence is defined in terms of truth preservation at @. De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 22 / 26

Beyond intuitionistic logic Definition In Gödel logics: A = 1 iff A = 1, otherwise A = 0. Theorem is Baaz delta! ( I (w, A) = 1 iff I (@, A) = 1.) Remark Another example of negative modality being powerful! De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 23 / 26

Conclusion Summary Axiomatized SJ expanded by classical and empirical negation. We can go even weaker to work with B +. Observed a connection between Baaz delta and empirical negation. In sum: empirical negation is quite flexible! (This implies the ubiquity of classical negation?) Future directions Add quantifiers! Relate SJ and its extensions with other systems of modal logic! De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 25 / 26

KÖSZÖNÖM!!! De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016 26 / 26