SlideShare a Scribd company logo
1/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Negation in the Ecumenical System
Valeria de Paiva
Joint work with
Elaine Pimentel and Luiz Carlos Pereira
Brasil-Colombia 2021
Dec 2021
1 / 27
2/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Many Thanks!
Elaine Pimentel and Luiz Carlos Pereira
Also Marcelo, Hugo, Ciro, Samuel, Andrés and Pedro, for organizing!
2 / 27
3/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
An Accidental Intuitionist
would want to use classical logic too!
Intuitionism because pragmatism: More convincing to have a term
t such that ∃x.A(x) is true means A(t) holds, then to have to say
that it is not the case that (∀x.¬A(x))
Our work:
Duas Negações Ecumênicas, L. C. Pereira, Elaine Pimentel
and V. de Paiva, to appear
An ecumenical notion of entailment, E. Pimentel, L. C.
Pereira and V. de Paiva, Synthese, 198(22), 5391-5413, 2019.
A proof theoretical view of ecumenical systems, Elaine
Pimentel, Luiz Carlos Pereira and Valeria de Paiva, short
paper LSFA 2018.
3 / 27
4/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
An Accidental Intuitionist
Inspiration: ‘Classical versus Intuitionistic Logic’, Prawitz 2015
4 / 27
5/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Dummett, did you say?
I am, thus, not concerned with justifications of intuitionis-
tic mathematics from an eclectic point of view, that is,
from one which would admit intuitionistic mathematics as
a legitimate and interesting form of mathematics alongside
classical mathematics: I am concerned only with the stand-
point of the intuitionists themselves, namely that classical
mathematics employs forms of reasoning which are not
valid on any legitimate construal of mathematical state-
ments (save, occasionally, by accident, as it were, under a
quite unintended reinterpretation).
Dummett, ‘The Philosophical Basis of Intuitionistic Logic’, 1973
5 / 27
6/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Michael Dummet and Dag Prawitz
6 / 27
7/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Prawitz
My interest in logic is first of all an interest in deductive
reasoning. I see so-called classical first order predicate
logic as an attempted codification of inferences occurring
in actual deductive practice.[...]
Only if it can be shown that the classical ideas about mea-
ning are mistaken and that no intelligible meaning can be
attached to the logical constants agreeing with the classi-
cal use of them, is the intuitionistic codification of mathe-
matical reasoning of interest, according to Dummett.
[Dummett] dismisses an ecletic attitute that finds an in-
terest in both the classical and the intuitionistic codifica-
tion.
Prawitz, ‘Classical versus Intuitionistic Logic’ 2015
7 / 27
8/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Prawitz on classical constants
Gentzen’s introduction rules are of course accepted also in
classical reasoning, but some of them can clearly not serve
as explanations of meaning.
[...]an existential sentence ∃xA(x) may be rightly asserted
classically without knowing how to find a proof of some
instance A(t). Hence, Gentzen’s introduction rule for the
existential quantifier, which allows one to infer ∃xA(x)
from A(t), does not determine what is to count classi-
cally as a canonical proof of ∃xA(x) and therefore does
not either determine the classical meaning of the existen-
tial quantifier.
Prawitz, ‘Classical versus Intuitionistic Logic’ 2015
8 / 27
9/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Prawitz conclusion
Comparing the two codifications, it is clearly wrong to ar-
gue that classical logic is stronger than intuitionistic. What
can be said is instead that the intuitionistic language is
more expressive than the classical one, having access to
stronger existence statements that cannot be expressed in
the classical language. However, there is no need to cho-
ose between the two codifications because we can have a
more comprehensive one that codifies both classical and
intuitionistic reasoning based on a uniform pattern of me-
aning explanations.
9 / 27
10/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Ecumenical system
Definition
ecumenical (adjective) promoting or relating to unity among the
world’s Christian Churches.
catholic (adjective) including a wide variety of things;
all-embracing.
Here: a codification where two or more logics can coexist in peace
If they are sufficiently ecumenical and can use the other’s
vocabulary in their own speech, a classical logician and an
intuitionist can both adopt the present mixed system, and
the intuitionist must then agree that A ∨c ¬A is trivially
provable for any sentence A, even when it contains intui-
tionistic constants, and the classical logician must admit
that he has no ground for universally asserting A ∨i ¬A,
even when A contains only classical constants. 10 / 27
11/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Ecumenical System
Prawitz seems to agree with Quine when he says:
When the classical and intuitionistic codifications attach
different meanings to a constant, we need to use diffe-
rent symbols, and I shall use a subscript c for the classical
meaning and i for the intuitionistic. The classical and in-
tuitionistic constants can then have a peaceful coexistence
in a language that contains both.
11 / 27
12/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Prawitz System
The ecumenical system defined by Prawitz has:
two disjunctions (∨c, ∨i ),
two implications (→c, →i ),
two existential quantifiers (∃c, ∃i ),
but only one conjunction, one negation, one constant for the
absurd and one universal quantifier.
Why? Is this optimal? Which criteria can we use?
12 / 27
13/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Prawitz Ecumenical Natural Deduction
1 Gentzen’s introduction and elimination rules for ⊥, ∧, ¬, and
∀: intro rule for ⊥ is vacant, elim rule allows arbitrary
sentence from ⊥;
2 Gentzen’s introduction and elimination rules for ∨, →, and ∃,
where now i is attached as a subscript to the logical constant;
3 New classical rules
4 Predicates
13 / 27
14/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Prawitz Ecumenical Natural Deduction
14 / 27
15/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Prawitz Ecumenical Natural Deduction
15 / 27
16/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Prawitz Ecumenical Natural Deduction
16 / 27
17/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
The Problem
Given that
we have two implications one classical and one intuitionistic,
the negation of a proposition A can be understood as A
implies ⊥
why do we have only one negation? and why do we have a single
constant for absurd?
Why don’t we have
a classical negation ¬cA, understood as (A →c ⊥)
an intuitionistic negation ¬i A, understood as (A →i ⊥)?
17 / 27
18/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Partial answer: Interderivability
18 / 27
19/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Interderivability
Interderivability is a weak form of equivalence.
The fact that all theorems of classical propositional logic are
‘equivalent’ clearly does not imply that we just have one theorem!
Although it is not clear how to define a more robust notion of
equivalence, it is clear that ‘material equivalence’ alone may is not
sufficient to justify the use of a single negation.
19 / 27
20/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
A different answer
There is just one way to assert the negation of a proposition A, to
wit, to produce a derivation of a contradiction from the
assumption A.
Support from Proof Theory? Seldin’s result:
Given a normal proof Π of ¬A in classical first order or in
intuitionistic first-order logic, then the last rule applied in Π is
¬-introduction, i.e. ¬-introduction is the only rule that allows us
to prove the negation of a proposition
20 / 27
21/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
A different answer
It is true, we may have different ways to produce a contradiction
from a given set of assumptions, a classical and an intuitionistic,
but in both the same assertability condition holds: in order to
assert ¬A, we should deduce a contradiction from A!
21 / 27
22/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
A different question
Question: Can we find a derivation of ⊥ from A such that it is
‘essentially classic’, in the sense that it ‘essentially’ uses classical
reasoning in the derivation of ⊥ from A?
22 / 27
23/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Glivenko Theorems
In the case of propositional logic, the answer is a strong no!
Given any classical derivation of ⊥ from an assumption A, there is
also an intuitionistic derivation of ⊥ from the assumption A.
This is a consequence of Glivenko’s theorems and the
normalization theorem.
23 / 27
24/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Glivenko’s theorems
24 / 27
25/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Glivenko’s theorems
But two problems:
1. what’s the categorification of Seldin’s normalization strategy?
2. what do we do in first-order?
25 / 27
26/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Summing up
Some good reasons for just one negation:
Interderivability
Assertability conditions
Computational Isomorphism
Some hope for purity: STOUP!
So we say, but plenty of interesting problems...
Anyways:
Many different ways of putting together classical and intuitionistic
reasoning.
26 / 27
27/27
Introduction
Ecumenical Logic
One or Two negations?
Parting Thoughts
Related Work
Our paper mentions Dowek 2015, Krauss 1992 (unpublished),
Caleiro&Ramos 2007, Liang and Miller 2014, Girard LC and LU.
Only Kripke semantics for most
I don’t know of any system where the syntax and the (categorical)
semantics work as well as for IPC. Is there one already in
existence? Can we find one? What’s the best we can do?
Thanks!
27 / 27

More Related Content

PDF
Category Theory for All (NASSLLI 2012)
PDF
Constructive Modalities
PDF
Constructive Modalities
PDF
Modal Type Theory
PDF
Dialectica Comonads
PDF
Categorical Semantics for Explicit Substitutions
PDF
A Dialectica Model of Relevant Type Theory
PDF
Categorical Explicit Substitutions
Category Theory for All (NASSLLI 2012)
Constructive Modalities
Constructive Modalities
Modal Type Theory
Dialectica Comonads
Categorical Semantics for Explicit Substitutions
A Dialectica Model of Relevant Type Theory
Categorical Explicit Substitutions

What's hot (20)

PDF
Dialectica amongst friends
PDF
Intuitionistic Modal Logic: fifteen years later
PDF
Dialectica Categories for the Lambek Calculus
PDF
Going Without: a modality and its role
PDF
Pure Algebra to Applied AI: a personal journey
PDF
Constructive Modal and Linear Logics
PDF
Relevant Dialectica Categories
PDF
Going Without: a modality and its role
PDF
Benchmarking Linear Logic Proofs
PDF
Constructive Modal Logics, Once Again
PDF
Fun with Constructive Modalities
PDF
Dialectica Categories for the Lambek Calculus
PDF
Categorical Semantics for Explicit Substitutions
PDF
Logics of Context and Modal Type Theories
PDF
Dialectica Categories and Petri Nets
PPTX
The logic(s) of informal proofs (vub)
PDF
Intuitive Semantics for Full Intuitionistic Linear Logic (2014)
PDF
Benchmarking Linear Logic Proofs, Valeria de Paiva
PDF
Dialectica Categories and Petri Nets
PPTX
The logic(s) of informal proofs (tyumen, western siberia 2019)
Dialectica amongst friends
Intuitionistic Modal Logic: fifteen years later
Dialectica Categories for the Lambek Calculus
Going Without: a modality and its role
Pure Algebra to Applied AI: a personal journey
Constructive Modal and Linear Logics
Relevant Dialectica Categories
Going Without: a modality and its role
Benchmarking Linear Logic Proofs
Constructive Modal Logics, Once Again
Fun with Constructive Modalities
Dialectica Categories for the Lambek Calculus
Categorical Semantics for Explicit Substitutions
Logics of Context and Modal Type Theories
Dialectica Categories and Petri Nets
The logic(s) of informal proofs (vub)
Intuitive Semantics for Full Intuitionistic Linear Logic (2014)
Benchmarking Linear Logic Proofs, Valeria de Paiva
Dialectica Categories and Petri Nets
The logic(s) of informal proofs (tyumen, western siberia 2019)
Ad

Similar to Negation in the Ecumenical System (20)

PDF
The Continuum Companion To Philosophical Logic Leon Horsten Richard Pettigrew...
PDF
Inconsistent Geometry Studies In Logic Mortensen Chris
PDF
Differences Between Informal Logic, And Theoretical...
PDF
A Refutation Of Matteo Plebani
PDF
Lesson 30
PDF
AI Lesson 30
PDF
The principle of constructive mathematizability of any theory: A sketch of fo...
PDF
A Priori A Posteriori
PDF
Modal Syllogistic - Master Thesis
PDF
A New Look At The Cosmological Argument
PDF
29364360 the-logic-of-transdisciplinarity-2
PPTX
The logic(s) of informal proofs (vub)
PDF
Falsiability.pdf
PDF
Bunge - critica a dialectica
PDF
a logical approach to abstract algebra (apuntes).pdf
PDF
Introduction to set theory by william a r weiss professor
PDF
What Is Complexity Science? A View from Different Directions.pdf
DOCX
Chapter 1 Logic and ProofPropositional Logic SemanticsPropo.docx
PDF
Philosophy chapter i_ok10
PDF
The formalized hodological methodology
The Continuum Companion To Philosophical Logic Leon Horsten Richard Pettigrew...
Inconsistent Geometry Studies In Logic Mortensen Chris
Differences Between Informal Logic, And Theoretical...
A Refutation Of Matteo Plebani
Lesson 30
AI Lesson 30
The principle of constructive mathematizability of any theory: A sketch of fo...
A Priori A Posteriori
Modal Syllogistic - Master Thesis
A New Look At The Cosmological Argument
29364360 the-logic-of-transdisciplinarity-2
The logic(s) of informal proofs (vub)
Falsiability.pdf
Bunge - critica a dialectica
a logical approach to abstract algebra (apuntes).pdf
Introduction to set theory by william a r weiss professor
What Is Complexity Science? A View from Different Directions.pdf
Chapter 1 Logic and ProofPropositional Logic SemanticsPropo.docx
Philosophy chapter i_ok10
The formalized hodological methodology
Ad

More from Valeria de Paiva (20)

PDF
Dialectica Comonoids
PDF
Dialectica Categorical Constructions
PDF
Logic & Representation 2021
PDF
Constructive Modal and Linear Logics
PDF
Dialectica Categories Revisited
PDF
PLN para Tod@s
PDF
Networked Mathematics: NLP tools for Better Science
PDF
Going Without: a modality and its role
PDF
Problemas de Kolmogorov-Veloso
PDF
Natural Language Inference: for Humans and Machines
PDF
Dialectica Petri Nets
PDF
The importance of Being Erneast: Open datasets in Portuguese
PDF
Semantics and Reasoning for NLP, AI and ACT
PDF
NLCS 2013 opening slides
PDF
Logic and Probabilistic Methods for Dialog
PDF
Dialectica and Kolmogorov Problems
PDF
Gender Gap in Computing 2014
PDF
Categorical Proof Theory for Everyone
PDF
Dialectica and Kolmogorov Problems
PDF
Linear Logic and Constructive Mathematics, after Shulman
Dialectica Comonoids
Dialectica Categorical Constructions
Logic & Representation 2021
Constructive Modal and Linear Logics
Dialectica Categories Revisited
PLN para Tod@s
Networked Mathematics: NLP tools for Better Science
Going Without: a modality and its role
Problemas de Kolmogorov-Veloso
Natural Language Inference: for Humans and Machines
Dialectica Petri Nets
The importance of Being Erneast: Open datasets in Portuguese
Semantics and Reasoning for NLP, AI and ACT
NLCS 2013 opening slides
Logic and Probabilistic Methods for Dialog
Dialectica and Kolmogorov Problems
Gender Gap in Computing 2014
Categorical Proof Theory for Everyone
Dialectica and Kolmogorov Problems
Linear Logic and Constructive Mathematics, after Shulman

Recently uploaded (20)

PDF
composite construction of structures.pdf
PPTX
bas. eng. economics group 4 presentation 1.pptx
PPTX
Lesson 3_Tessellation.pptx finite Mathematics
PDF
Well-logging-methods_new................
PDF
SM_6th-Sem__Cse_Internet-of-Things.pdf IOT
PDF
Model Code of Practice - Construction Work - 21102022 .pdf
PDF
Arduino robotics embedded978-1-4302-3184-4.pdf
PPTX
Recipes for Real Time Voice AI WebRTC, SLMs and Open Source Software.pptx
PPTX
UNIT 4 Total Quality Management .pptx
PPT
Mechanical Engineering MATERIALS Selection
PPTX
web development for engineering and engineering
PDF
Embodied AI: Ushering in the Next Era of Intelligent Systems
PDF
PRIZ Academy - 9 Windows Thinking Where to Invest Today to Win Tomorrow.pdf
PPTX
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
PDF
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
DOCX
573137875-Attendance-Management-System-original
PPTX
Sustainable Sites - Green Building Construction
PPTX
Construction Project Organization Group 2.pptx
PPTX
Engineering Ethics, Safety and Environment [Autosaved] (1).pptx
PPTX
CH1 Production IntroductoryConcepts.pptx
composite construction of structures.pdf
bas. eng. economics group 4 presentation 1.pptx
Lesson 3_Tessellation.pptx finite Mathematics
Well-logging-methods_new................
SM_6th-Sem__Cse_Internet-of-Things.pdf IOT
Model Code of Practice - Construction Work - 21102022 .pdf
Arduino robotics embedded978-1-4302-3184-4.pdf
Recipes for Real Time Voice AI WebRTC, SLMs and Open Source Software.pptx
UNIT 4 Total Quality Management .pptx
Mechanical Engineering MATERIALS Selection
web development for engineering and engineering
Embodied AI: Ushering in the Next Era of Intelligent Systems
PRIZ Academy - 9 Windows Thinking Where to Invest Today to Win Tomorrow.pdf
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
573137875-Attendance-Management-System-original
Sustainable Sites - Green Building Construction
Construction Project Organization Group 2.pptx
Engineering Ethics, Safety and Environment [Autosaved] (1).pptx
CH1 Production IntroductoryConcepts.pptx

Negation in the Ecumenical System

  • 1. 1/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Negation in the Ecumenical System Valeria de Paiva Joint work with Elaine Pimentel and Luiz Carlos Pereira Brasil-Colombia 2021 Dec 2021 1 / 27
  • 2. 2/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Many Thanks! Elaine Pimentel and Luiz Carlos Pereira Also Marcelo, Hugo, Ciro, Samuel, Andrés and Pedro, for organizing! 2 / 27
  • 3. 3/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts An Accidental Intuitionist would want to use classical logic too! Intuitionism because pragmatism: More convincing to have a term t such that ∃x.A(x) is true means A(t) holds, then to have to say that it is not the case that (∀x.¬A(x)) Our work: Duas Negações Ecumênicas, L. C. Pereira, Elaine Pimentel and V. de Paiva, to appear An ecumenical notion of entailment, E. Pimentel, L. C. Pereira and V. de Paiva, Synthese, 198(22), 5391-5413, 2019. A proof theoretical view of ecumenical systems, Elaine Pimentel, Luiz Carlos Pereira and Valeria de Paiva, short paper LSFA 2018. 3 / 27
  • 4. 4/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts An Accidental Intuitionist Inspiration: ‘Classical versus Intuitionistic Logic’, Prawitz 2015 4 / 27
  • 5. 5/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Dummett, did you say? I am, thus, not concerned with justifications of intuitionis- tic mathematics from an eclectic point of view, that is, from one which would admit intuitionistic mathematics as a legitimate and interesting form of mathematics alongside classical mathematics: I am concerned only with the stand- point of the intuitionists themselves, namely that classical mathematics employs forms of reasoning which are not valid on any legitimate construal of mathematical state- ments (save, occasionally, by accident, as it were, under a quite unintended reinterpretation). Dummett, ‘The Philosophical Basis of Intuitionistic Logic’, 1973 5 / 27
  • 6. 6/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Michael Dummet and Dag Prawitz 6 / 27
  • 7. 7/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Prawitz My interest in logic is first of all an interest in deductive reasoning. I see so-called classical first order predicate logic as an attempted codification of inferences occurring in actual deductive practice.[...] Only if it can be shown that the classical ideas about mea- ning are mistaken and that no intelligible meaning can be attached to the logical constants agreeing with the classi- cal use of them, is the intuitionistic codification of mathe- matical reasoning of interest, according to Dummett. [Dummett] dismisses an ecletic attitute that finds an in- terest in both the classical and the intuitionistic codifica- tion. Prawitz, ‘Classical versus Intuitionistic Logic’ 2015 7 / 27
  • 8. 8/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Prawitz on classical constants Gentzen’s introduction rules are of course accepted also in classical reasoning, but some of them can clearly not serve as explanations of meaning. [...]an existential sentence ∃xA(x) may be rightly asserted classically without knowing how to find a proof of some instance A(t). Hence, Gentzen’s introduction rule for the existential quantifier, which allows one to infer ∃xA(x) from A(t), does not determine what is to count classi- cally as a canonical proof of ∃xA(x) and therefore does not either determine the classical meaning of the existen- tial quantifier. Prawitz, ‘Classical versus Intuitionistic Logic’ 2015 8 / 27
  • 9. 9/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Prawitz conclusion Comparing the two codifications, it is clearly wrong to ar- gue that classical logic is stronger than intuitionistic. What can be said is instead that the intuitionistic language is more expressive than the classical one, having access to stronger existence statements that cannot be expressed in the classical language. However, there is no need to cho- ose between the two codifications because we can have a more comprehensive one that codifies both classical and intuitionistic reasoning based on a uniform pattern of me- aning explanations. 9 / 27
  • 10. 10/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Ecumenical system Definition ecumenical (adjective) promoting or relating to unity among the world’s Christian Churches. catholic (adjective) including a wide variety of things; all-embracing. Here: a codification where two or more logics can coexist in peace If they are sufficiently ecumenical and can use the other’s vocabulary in their own speech, a classical logician and an intuitionist can both adopt the present mixed system, and the intuitionist must then agree that A ∨c ¬A is trivially provable for any sentence A, even when it contains intui- tionistic constants, and the classical logician must admit that he has no ground for universally asserting A ∨i ¬A, even when A contains only classical constants. 10 / 27
  • 11. 11/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Ecumenical System Prawitz seems to agree with Quine when he says: When the classical and intuitionistic codifications attach different meanings to a constant, we need to use diffe- rent symbols, and I shall use a subscript c for the classical meaning and i for the intuitionistic. The classical and in- tuitionistic constants can then have a peaceful coexistence in a language that contains both. 11 / 27
  • 12. 12/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Prawitz System The ecumenical system defined by Prawitz has: two disjunctions (∨c, ∨i ), two implications (→c, →i ), two existential quantifiers (∃c, ∃i ), but only one conjunction, one negation, one constant for the absurd and one universal quantifier. Why? Is this optimal? Which criteria can we use? 12 / 27
  • 13. 13/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Prawitz Ecumenical Natural Deduction 1 Gentzen’s introduction and elimination rules for ⊥, ∧, ¬, and ∀: intro rule for ⊥ is vacant, elim rule allows arbitrary sentence from ⊥; 2 Gentzen’s introduction and elimination rules for ∨, →, and ∃, where now i is attached as a subscript to the logical constant; 3 New classical rules 4 Predicates 13 / 27
  • 14. 14/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Prawitz Ecumenical Natural Deduction 14 / 27
  • 15. 15/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Prawitz Ecumenical Natural Deduction 15 / 27
  • 16. 16/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Prawitz Ecumenical Natural Deduction 16 / 27
  • 17. 17/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts The Problem Given that we have two implications one classical and one intuitionistic, the negation of a proposition A can be understood as A implies ⊥ why do we have only one negation? and why do we have a single constant for absurd? Why don’t we have a classical negation ¬cA, understood as (A →c ⊥) an intuitionistic negation ¬i A, understood as (A →i ⊥)? 17 / 27
  • 18. 18/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Partial answer: Interderivability 18 / 27
  • 19. 19/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Interderivability Interderivability is a weak form of equivalence. The fact that all theorems of classical propositional logic are ‘equivalent’ clearly does not imply that we just have one theorem! Although it is not clear how to define a more robust notion of equivalence, it is clear that ‘material equivalence’ alone may is not sufficient to justify the use of a single negation. 19 / 27
  • 20. 20/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts A different answer There is just one way to assert the negation of a proposition A, to wit, to produce a derivation of a contradiction from the assumption A. Support from Proof Theory? Seldin’s result: Given a normal proof Π of ¬A in classical first order or in intuitionistic first-order logic, then the last rule applied in Π is ¬-introduction, i.e. ¬-introduction is the only rule that allows us to prove the negation of a proposition 20 / 27
  • 21. 21/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts A different answer It is true, we may have different ways to produce a contradiction from a given set of assumptions, a classical and an intuitionistic, but in both the same assertability condition holds: in order to assert ¬A, we should deduce a contradiction from A! 21 / 27
  • 22. 22/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts A different question Question: Can we find a derivation of ⊥ from A such that it is ‘essentially classic’, in the sense that it ‘essentially’ uses classical reasoning in the derivation of ⊥ from A? 22 / 27
  • 23. 23/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Glivenko Theorems In the case of propositional logic, the answer is a strong no! Given any classical derivation of ⊥ from an assumption A, there is also an intuitionistic derivation of ⊥ from the assumption A. This is a consequence of Glivenko’s theorems and the normalization theorem. 23 / 27
  • 24. 24/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Glivenko’s theorems 24 / 27
  • 25. 25/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Glivenko’s theorems But two problems: 1. what’s the categorification of Seldin’s normalization strategy? 2. what do we do in first-order? 25 / 27
  • 26. 26/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Summing up Some good reasons for just one negation: Interderivability Assertability conditions Computational Isomorphism Some hope for purity: STOUP! So we say, but plenty of interesting problems... Anyways: Many different ways of putting together classical and intuitionistic reasoning. 26 / 27
  • 27. 27/27 Introduction Ecumenical Logic One or Two negations? Parting Thoughts Related Work Our paper mentions Dowek 2015, Krauss 1992 (unpublished), Caleiro&Ramos 2007, Liang and Miller 2014, Girard LC and LU. Only Kripke semantics for most I don’t know of any system where the syntax and the (categorical) semantics work as well as for IPC. Is there one already in existence? Can we find one? What’s the best we can do? Thanks! 27 / 27