This document discusses the concept of an ecumenical logic system that allows both classical and intuitionistic reasoning to coexist. It summarizes Dag Prawitz's approach to defining such a system, which uses different symbols for logical constants that have different meanings classically versus intuitionistically. However, the document raises the question of why Prawitz's system only includes one symbol for negation rather than separate classical and intuitionistic negation symbols. Possible answers discussed include the interderivability of the two notions of negation and the view that negation asserts a contradiction from assuming the negated proposition. The document does not conclude there is a definitive answer and suggests this as an interesting open problem area.
Talk at the Melbourne Logic Seminar
on Shawn Standefer invitation
Dialectica categories for the Lambek calculus
Valeria de Paiva
The Topos Institute, Berkeley, CA
Abstract:
Dialectica categorical models of the Lambek Calculus were first presented in the Amsterdam Colloquium a long time ago. Following Lambek's lead, we approached the Lambek Calculus from the perspective of Linear Logic and adapted the Dialectica categorical models for Linear Logic to Lambek's non-commutative calculus. The old work took for granted the syntax of the Lambek calculus and only discussed the exciting possibilities of new models for the modalities that Linear Logic introduced. Many years later we find that the work on dialectica models of the Lambek calculus is still interesting and that it might inform some of the most recent work on the relationship between Categorial Grammars and notions of Distributional Semantics.
Thus we revisited the old work, making sure that the syntax details that were sketchy on the first version got completed and verified, using automated tools such as Agda and Ott. Ultimately we are interested in the applicability of the original systems to their intended uses in the construction of semantics of Natural Language. But before we can discuss it, we need to make sure that the mathematical properties that make the Lambek calculus attractive are all properly modeled and this is the main aim of this paper.
We recall the Lambek calculus with its Curry-Howard isomorphic term assignment system. We extend it with a $\kappa$ modality, inspired by Yetter's work, which makes the calculus commutative. Then we add the of-course modality $!$, as Girard did, re-introducing weakening and contraction for all formulas and get back the full power of intuitionistic and classical logic. We also present algebraic semantics and categorical semantics, proved sound and complete for the whole system. Finally, we show the traditional properties of type systems, like subject reduction, the Church-Rosser theorem and normalization for the calculi of extended modalities, which we did not have before.
Benchmarking Linear Logic Proofs, Valeria de PaivaValeria de Paiva
Talk at the 1st Joint Meeting Brazil-France in Mathematics, https://impa.br/eventos-do-impa/eventos-2019/1st-joint-meeting-brazil-france-in-mathematics/
Talk at the Melbourne Logic Seminar
on Shawn Standefer invitation
Dialectica categories for the Lambek calculus
Valeria de Paiva
The Topos Institute, Berkeley, CA
Abstract:
Dialectica categorical models of the Lambek Calculus were first presented in the Amsterdam Colloquium a long time ago. Following Lambek's lead, we approached the Lambek Calculus from the perspective of Linear Logic and adapted the Dialectica categorical models for Linear Logic to Lambek's non-commutative calculus. The old work took for granted the syntax of the Lambek calculus and only discussed the exciting possibilities of new models for the modalities that Linear Logic introduced. Many years later we find that the work on dialectica models of the Lambek calculus is still interesting and that it might inform some of the most recent work on the relationship between Categorial Grammars and notions of Distributional Semantics.
Thus we revisited the old work, making sure that the syntax details that were sketchy on the first version got completed and verified, using automated tools such as Agda and Ott. Ultimately we are interested in the applicability of the original systems to their intended uses in the construction of semantics of Natural Language. But before we can discuss it, we need to make sure that the mathematical properties that make the Lambek calculus attractive are all properly modeled and this is the main aim of this paper.
We recall the Lambek calculus with its Curry-Howard isomorphic term assignment system. We extend it with a $\kappa$ modality, inspired by Yetter's work, which makes the calculus commutative. Then we add the of-course modality $!$, as Girard did, re-introducing weakening and contraction for all formulas and get back the full power of intuitionistic and classical logic. We also present algebraic semantics and categorical semantics, proved sound and complete for the whole system. Finally, we show the traditional properties of type systems, like subject reduction, the Church-Rosser theorem and normalization for the calculi of extended modalities, which we did not have before.
Benchmarking Linear Logic Proofs, Valeria de PaivaValeria de Paiva
Talk at the 1st Joint Meeting Brazil-France in Mathematics, https://impa.br/eventos-do-impa/eventos-2019/1st-joint-meeting-brazil-france-in-mathematics/
The principle of constructive mathematizability of any theory: A sketch of fo...Vasil Penchev
A principle, according to which any scientific theory can be mathematized, is investigated. That theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather a metamathematical axiom about the relation of mathematics and reality.
Its investigation needs philosophical means. Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction.
Accepting or rejecting the principle, two kinds of mathematics appear differing from each other by its relation to reality. Accepting the principle, mathematics has to include reality within itself in a kind of Pythagoreanism. These two kinds are called in paper correspondingly Hilbert mathematics and Gödel mathematics. The sketch of the proof of the principle demonstrates that the generalization of Peano arithmetic as above can be interpreted as a model of Hilbert mathematics into Gödel mathematics therefore showing that the former is not less consistent than the latter, and the principle is an independent axiom.
An information interpretation of Hilbert mathematics is involved. It is a kind of ontology of information. Thus the problem which of the two mathematics is more relevant to our being (rather than reality for reality is external only to Gödel mathematics) is discussed. An information interpretation of the Schrödinger equation is involved to illustrate the above problem.
Chapter 1 Logic and ProofPropositional Logic SemanticsPropo.docxcravennichole326
Chapter 1: Logic and Proof
Propositional Logic Semantics
Propositional variables: p, q, r, s, ... (stand for simple sentences)
T: any proposition that is always true
F: any proposition that is always false
Compound propositions: formed from propositional variables and logical operators (all binary except negation):
Negation ¬
Conjunction ∧
Disjunction ∨
Implication →
Biconditional ↔
Exclusive Or ⊕
Truth Tables: assign all possible T, F to all possible variables, and determines all possible T, F of compound propositions; with n variables there are 2n rows in the table
Negation changes T to F and vice versa
Conjunction is only T if both conjuncts are T
Disjunction is only F is both disjuncts are F
Implication is only F is the antecedent is T and the consequent is F
Biconditional is only true if they have the same tvalue
Exclusive Or is only T if they differ in tvalue
Two (compound) propositions are equivalent (≡) iff they always have the same tvalue (see also below)
English translations:
Conjunction: and, but, although, yet, still, ...
Disjunctions: or, unless
Implication: if, if ... then, only if, when, implies, entails, follows from, is sufficient, is necessary, when, whenever
Biconditional: if and only if, just in case, is necessary and sufficient
A set of propositions is consistent iff there is some assignment of tvalue that makes all T
A set of propositions is inconsistent iff there is no assignment of tvalue that makes all T
A tautology is a compound propositions that is always T
A contradiction is a compound propositions that is always F
A contingency is a compound propositions that is sometimes T, sometimes F
A compound proposition is satisfiable iff some assignment of tvalues make it T
A compound proposition is unsatisfiable iff no assignment of tvalues make it T
Two compound propositions p and q are logically equivalent iff p ↔ q is a tautology
Common equivalences:
DeMorgan’s Laws (Dem)
¬(p ∨ q)≡¬p ∧ ¬q
¬(p ∧ q)≡¬p ∨ ¬q
Identity Laws (Id)
p ∧ T ≡p
p ∨ F ≡p
Domination Laws (Dom)
p ∨ T ≡T
p ∧ F ≡F
Idempotent Laws (Idem)
p ∨ T ≡T
p ∧ p ≡p
Double Negation Law (DN)
¬(¬p) ≡ p
Negation Laws (Neg)
p ∨ ¬p ≡T
p ∧ ¬p ≡F
Commutative Laws (Comm)
p ∨ q ≡q ∨ p
p ∧ q ≡q ∧ p
Associative Laws (Assoc)
(p ∨ q) ∨ r ≡p ∨ (q ∨ r)
(p ∧ q) ∧ r ≡p ∧ (q ∧ r)
Distributive Laws (Dist)
p ∨ (q ∧ r) ≡
(p ∨ q) ∧ (p ∨ r)
p ∧ (q ∨ r) ≡
(p ∧ q) ∨ (p ∧ r)
Absorption Laws (Abs)
p ∨ (p ∧ q) ≡ p
p ∧ (p ∨ q) ≡ p
Conditional Laws (Cond)
p →q≡ ¬p ∨ q
¬(p →q)≡ p ∧ ¬q
Biconditional Law (Bicond)
p ↔ q ≡ (p →q) ∧ (q →p)
Quantifier Negation (QNeg)
¬ ∀x P ( x ) ≡ ∃x ¬ P ( x )
¬ ∃x P ( x ) ≡ ∀x ¬ P ( x )
Predicate and Relational Logic (Quantificational Logic, First Order Logic): Semantics
Variables: x, y, z, ...
Predicates/Relations, Propositional Functions: P(x), M(x), Q(x,y), S(x,y,z), ...
Constants: a, b, c, 0, -1, 4, Socrates, ...
Domain (U): set of things the variables range over
Propositional functions are neither T nor F; however, if all the variables are re ...
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
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
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
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
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
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