The Speakers

 

 

Gilles Dowek

In the case of constructive natural deduction, a well-established thesis states that the meaning of a logical constant is defined by its introduction rules. We shall discuss how the recent development of non harmonious logics and ecumenical logics leads to revisit this thesis. (slides)

Iris van der Giessen

Abstract: The coreflection principle is an axiom in modal logic that can be considered as a ‘pure’ intuitionistic modal axiom in the following senses. The axiom reads as A -> box A and does not have a meaningful interpretation in classical normal modal logic. Interestingly, it pops up in different intuitionistic modal logics with their own interpretation: epistemic logic, provability logic, and lax logic. Moreover, these intuitionistic modal logics contain only the box and form an interesting study of intuitionistic modalities next to the central discussion of the intuitionistic diamond.

In this talk, I would like to discuss interpretations, axiomatizations and birelational semantics for these logics. In addition, I would like to show some results on the so-called admissible rules for these logics (see, https://doi.org/10.1016/j.apal.2022.103233). Finally, I recently came across an ecumenical treatment in the so-called ‘joint logic of problems and propositions’ introduced by Melikhov (see https://arxiv.org/abs/1312.2575), in which the co-reflection principle plays a role. (slides)

Dale Miller

Abstract: While Gentzen's sequent calculus provides a framework for developing the proof theory of classical and intuitionistic logic, it does not provide one logic that combines them. There are, of course, several ways to relate classical and intuitionistic logic. For example, intuitionistic logic can be translated into classical logic with the addition of the S4 modality, and classical logic can be embedded into intuitionistic logic using negation translations. Here we consider the problem of building proof systems and semantics for a logic in which classical and intuitionistic connectives mix freely. Our solution, the logic of Polarized Intuitionistic Logic, employs a polarization (red/green) of formulas and two entailment judgments. We give a Kripke semantics and a sequent calculus for this logic for which soundness and completeness holds. The sequent calculus proof system mixes elements of Gentzen's LJ proof system and Girard's LC proof system. This talk is based on joint work with Chuck Liang, published in the APAL 2013. (slides)

Jean-Baptiste Joinet

Abstract: One traditional question of “Logical Ecumenism” is the following : when a connective (e.g. implication) is defined by rules (e.g. rules for implication in intuitionistic sequent calculus) which are specific instances of other given rules (e.g. rules for implication in classical sequent calculus), is it possible  to consider that those two sets of rules actually define two connectives (differently noted), able to live in harmony, notably at the computational level (cut-elimination) ? 

When one interprets “intuitionistic’’ and “classical’’ implications in Linear Logic, however, the difference between them is not caught at the level of the implication connective itself (i.e. by distinguishing two implication connectives), but by using differently the two exponentials (the modalities “!” and “?” of Linear Logic, which serve notably to indicate the potential use of left and right structural rules, respectively) when one interprets both implications.

While interpreting/translating the intuitionistic implication only requires the “!’’ exponential, using “?’’ is required to interpret the classical implication. At first sight,  “!’’ appears thus to be “the intuitionistic exponential’’, while “?’’ (needed for right structural operations) appears complementary as “the classical one’’. In a sense, the ecumenist question about the “two implications” is thus converted, in Linear Logic, into ecumenist questions about the “two exponentials”: In which respect, could one say that  “!’’ (resp. “?”) is “the intuitionistic (resp. classical) exponential’’ ? Do they really play such well differentiated roles ? How do they interact dynamically? 

In the presented work, we will keep using the exponential viewpoint to ecumenism, in order to create “intermediate exponentials” and use them to design computational systems of linear logic which are “intermediate” between Intuitionistic LL (ILL) and Classical LL (CLL). Methodologically, the focus is put on how to break the symmetrical interdependency between ! and ? which prevails in CLL, in order to get “!” and the resulting “?” playing well differentiated roles – and this without to loose the computational properties (closure by cut-elimination, atomizability of identity axioms). Four main systems are designed (Dissymmetrical LL, semi-functorial Dissymmetrical LL, semi-specialized Dissymmetrical LL, bi-conclusion LL). (slides) and (slides)

Alexander Gheorghiu

Abstract: We provide a framework for a uniform decomposition of proof systems for non-classical logics into other logics, especially classical logic, by means of an algebra of constraints; for example, a decomposition of intuitionistic logic into classical logic together with Boolean constraints. In summary, one recovers a proof system for a target logic by enriching a proof system for a simpler logic with an algebra of constraints that act as correctness conditions on the latter to capture the former. The value of the framework is as  a tool for uniform and modular treatment of proof theory, and provide a bridge between semantics of more complex logics and their proof theory. (slides)

Mattia Petrolo

Abstract: We investigate a system of natural deduction in which two negations - one classical, the other constructive - coexist. The way in which this system combines intuitionistic and classical logic provides a unified calculus that codifies both constructive and classical reasoning, on the basis of a uniform pattern of meaning explanations. This setting allows one to avoid the collapse typically engendered by combining classical and intuitionistic negations in a single system. We provide a meaning-theoretic interpretation of the system, which is compatible with the tenets of proof-theoretic semantics. (Joint work with Paolo Pistone)

Émilie Grienenberger

Abstract: Using a common language to describe the logical foundations of various proof assistants allows more interoperability between the currently impermeable libraries of formal proofs. Indeed, it is a valuable tool in the design of translations, the constitution of a common database of proofs, or even the hybridization of their proofs. In the zoology of proof assistants, there are many examples of classical systems (the HOL family, PVS, etc) and constructive systems (Coq, Agda, Matita, etc), thus ecumenical logics could be useful tools for interoperabilty.

We present an ecumenical system called NE and based on many-sorted natural deduction, and its associated modulo theory framework allowing to define computational ecumenical theories. Proof normalization can be established for a subclass of computational theories; notably constructive properties as the witness property hold for externally intuitionistic objects in these theories. This framework is expressive enough to define a higher order ecumenical logic as a first order computation theory.

On a more practical note, the logic NE can be expressed in the logical framework Dedukti and used to implement, import, check, store, and transform proofs coming from diverse proof systems. (slides)

Matteo Tesi

Abstract: We propose an ecumenical approach to infinitary logic. In particular, we first detail the inadequacy of Kripke style semantics to model infinitary intuitionistic logic and we provide a neighborhood semantics. Next, we introduce a labelled sequent calculus which combines classical and intuitionistic connectives. The resulting system satisfies desirable structural properties such as admissibility of the structural rules of contraction and cut. Classical and intuitionistic infinitary logics emerge as fragments of the labelled system. Finally, the calculus is exploited in order to prove an extension  of the modal embedding to the infinitary setting. (slides)

Victor Nascimento

Abstract: Debates concerning philosophical grounds for the validity of classical and intuitionistic logic often have the very nature of logical proofs as one of the main points of controversy. The intuitionist advocates for a strict notion of constructive proof, while the classical logician advocates for a notion which allows non-construtive proofs through reductio ad absurdum. A great deal of controversy still subsists to this day on the matter, as there is no agreement between disputants on the precise standing of non-constructive methods. Two very distinct approaches to logic are currently providing interesting contributions to this debate. The first, oftentimes called Logical Ecumenism, aims to provide a unified framework in which two "rival" logics may peacefully coexist, thus providing some sort of neutral ground for the contestants. The second, Proof-theoretic Semantics, aims not only to elucidate the meaning of a logical proof, but also to provide means for its use as a basic concept of semantic analysis. Logical Ecumenism thus provides a medium in which meaningful interactions may occur between classical and intuitionistic logic, whilst Proof-theoretic Semantics provides a way of clarifying what is at stake when one accepts or denies reductio ad absurdum as a meaningful proof method. Our proposal aims to combine both approaches by providing not only a medium in which classical and intuitionistic logic may coexist, but also one in which classical and intuitionistic notions of proof may coexist. This is done through the use of atomic systems and base-extension semantics, which may be used to codify (I) a instuitionistic proof of an atom A as the constructibility of A in the atomic system, and (II) a classical proof of the atom A as the consistency of A with respect to the atomic system. This distinction allows us not only to obtain classical behavior for formulas containing classical atoms and intuitionistic behavior for formulas containing intuitionistic atoms, but also to put on the spotlight some basic properties of semantic entailment which are not always evident on traditional semantic analysis. As such, it may shed light on semantic differences between intuitionistic and classical logic from an even broader perspective. (slides)

This is joint work with Luiz Carlos Pereira and Elaine Pimentel

Luiz Carlos Pereira

Abstract: Ecumenical systems are formal codications where two or more logics, even rival logics, can co-exist in peace, and this means that these logics accept and reject the same things, the same rules and the same basic principles. Dag Prawitz proposed a natural deduction ecumenical system, where classical logic and intuitionistic logic are codified in the same system. In this system, the classical logician and the intuitionistic logician would share the universal quantifier, conjunction, negation and the constant for the absurd, but they would each have their own existential quantifier, disjunction and implication, with different meanings. Prawitz main idea is that these different meanings are given by a semantical framework that can be accepted by both parties. That there is a relation between translations and the ecumenical perspective is undeniable. Prawitz himself observes in his paper that Highly relevant to these discussions are the well-known translations of classical predicate logic into intuitionistic predicate logic, first discovered by Gentzen and Gödel. Also of some relevance is the (less well-known) translation of intuitionistic predicate logic into quantifieed classical S4 established by Prawitz & Malmnäs (1968). These translations will not be dealt with here. The emphasis will instead be on meaning-theoretical considerations, but they can be seen to some extent as spelling out the philosophical significance of the fact that classical logic can be translated into intuitionistic logic. But it is also undeniable that the very nature of this relationship is controversial. In the limit, we could even think that in fact there is nothing new in the ecumenical perspective: the classical operators could be eliminated by definitions, like (A →c B) := ¬(A ^ ¬B). The aim of this short note is to show, in the propositional case, that there are interesting relations between the Gödel-Gentzen translation and the ecumenical perspective, but that the later cannot be reduced to the former, much less identified with the former. (slides)

This is joint work with Elaine Pimentel and Valeria de Paiva

Elaine Pimentel

Abstract: Natural deduction systems, as proposed by Gentzen and further studied by Prawitz, is one of the most well known proof-theoretical frameworks. Part of its success is based on the fact that natural deduction rules present a simple characterization of logical constants, especially in the case of intuitionistic logic. However, there has been a lot of criticism on extensions of the intuitionistic set of rules in order to deal with classical logic. Indeed, most of such extensions add, to the usual introduction and elimination rules, extra rules governing negation. As a consequence, several meta-logical properties, the most prominent one being harmony, are lost. In 2015 Dag Prawitz proposed a natural deduction ecumenical system, where classical logic and intuitionistic logic are codified in the same system. In this system, the classical logician and the intuitionistic logician would share the universal quantifier, conjunction, negation and the constant for the absurd, but they would each have their own existential quantifier, disjunction and implication, with different meanings. Prawitz' main idea is that these different meanings are given by a semantical framework that can be accepted by both parties. In his ecumenical system, Prawitz recovers the harmony of rules, but the rules for the classical operators do not satisfy separability. In fact, the classical rules are not pure, in the sense that negation is used in the definition of the introduction and elimination rules for the classical operators. In a recent work we proposed a system adapting, to the natural deduction framework, Girard's mechanism of stoup. This allowed the definition of a pure harmonic natural deduction system LEp for the propositional fragment of Prawitz' ecumenical logic. In this talk, we will show the proposal of an ecumenical term calculus based on Parigot's lambda-mu-calculus, where the idea of distant reductions is applied in the context of for general natural deduction rules. (slides)

This is joint work with Luiz Carlos Pereira, Delia Kesner and Mariana Milicich

Ricardo Rodriguez

Abstract: In the present study, we consider extensions of constructive logic with strong negation by means of unary modal operations. The constructive logic with strong negation has been defined by Nelson and independently by Markov and can be considered a substructural logic. Essentially, this logic is a formalization of the following idea. Usually, we refute a sentence φ either by reductio ad absurdum or by constructing a counter-example of φ. From a constructive point of view, these two ways are not equivalent. In an ecumenical sense, we have two kinds of negation because they obey two different principles: the principle of the third-excluded middle and the principle of non-contradiction. Nelson lattices (N3-lattices) are an algebraic semantics for this logic. They were introduced by H. Rasiowa, and it is known that they form a variety. An interesting result is that every Nelson lattice can be represented as a twist-structure over a Heyting algebra. A Twist structure over a lattice is a construction used by Kalman that allows us to represent an algebra as a subalgebra of a special binary power of the lattice obtained by considering its direct product and its order-dual. From a result of Sendlewski, we know that for every Nelson lattice A, there exists a Heyting algebra H such that A is isomorphic to a subalgebra of a twist structure over H. Indeed, given a Heyting algebra H = (H, ∧, ∨, →, ⊤, ⊥) and a Boolean filter F of H, let R(H, F ) := {(x, y) ∈ H × H : x ∧ y = ⊥ and x ∨ y ∈ F }. Then we have: 1. R(H, F ) = (R(H, F ), ∧, ∨, ∗, ⇒, ⊥, ⊤) is a Nelson lattice, where the operations are defined as follows: • (x, y) ∨ (s, t) = (x ∨ s, y ∧ t), • (x, y) ∧ (s, t) = (x ∧ s, y ∨ t), • (x, y) ∗ (s, t) = (x ∧ s, (x → t) ∧ (s → y)), • (x, y) ⇒ (s, t) = ((x → s) ∧ (t → y), x ∧ t), • ⊤ = (⊤, ⊥), ⊥ = (⊥, ⊤). 2. ¬(x, y) = (y, x), Given a Nelson lattice A, there is a Heyting algebra HA, unique up to isomorphism, and a unique Boolean filter FA of HA such that A is isomorphic to R(HA, FA). In our work, we introduce an extension of the previous twist-structure construction. We consider N3-lattices endowed with two unary modal operators. Finally, we show the connection between the twist representation and the calculus proposed in Pereira and Rodriguez, in the propositional case and its extension to the modal case, using relational semantics. (slides)

This is joint work with María Paula Menchón

Marcelo Coniglio

Abstract: While paraconsistency deals with excessive or dubious information, fuzzy logics were designed for reasoning with imprecise information, in particular, for reasoning with propositions containing vague predicates. Given that both paradigms are able to deal with these two types of information --unreliable, in the case of paraconsistent logics, and imprecise, in the case of fuzzy logics-- it seems reasonable to consider logics which combine both features, namely, paraconsistent fuzzy logics. In this contribution we survey the study paraconsistent logics arising from Gödel fuzzy logic (i.e. the extension of Intuitionistic logic with the prelinearity axiom) expanded with an involutive negation G_\sim as well as from its finite n-valued extensions nG_\sim. It is well-known that Gödel logic G coincides with its degree-preserving companion G^leq (since G has the deduction-detachment theorem), but this is not the case for G_\sim. In fact, G_\sim and $\Gsimleq$ are different logics, and moreover, while G^leq_sim is explosive w.r.t. Gödel negation \neg, it is paraconsistent w.r.t. the involutive negation \sim. In fact, G^leq_sim is then a paradefinite logic (w.r.t. \sim) in the sense of Arieli and Avron, as it is both paraconsistent and paracomplete, since the law of excluded middle fails, as in all fuzzy logics. We introduce the notion of saturated paraconsistency, a weaker notion than Avron et al.'s notion of ideal paraconsistency. Them we study the logics between nG^leq_sim (the n-valued Gödel logic with an involutive negation) and CPL, and we find that the ideal paraconsistent logics of this family are only the da Costa and D’Ottaviano’s 3-valued logic J_3 and its 4-valued version J_4. Moreover, we fully characterize the ideal and the saturated paraconsistent logics between nG^leq_sim and CPL. We also identify a large family of saturated paraconsistent logics in the family of intermediate logics for degree-preserving finite-valued Lukasiewicz logics. (slides)

This is joint work with Francesc Esteva, Joan Gispert and Lluis Godo

Umberto Rivieccio

Abstract: Recent research on algebraic models of quasi-Nelson logic - a non-involutive generalization of Nelson logic - has brought new attention to a number of classes of algebras which result from enriching (subreducts of) Heyting algebras with a special modal operator known in the literature as a “nucleus”. Among the various algebraic structures thus emerged, for which we employ the umbrella term “intuitionistic modal algebras”, some have been studied since at least the 1970s, usually within the framework of topology and sheaf theory. Others appear more exotic, for their primitive operations arise from algebraic terms of the intuitionistic modal language which have not been previously considered. We for instance investigate the variety of “weak implicative semilattices”, whose members are (non-necessarily distributive) meet semilattices endowed with a nucleus and an implication operation which is not a relative pseudo-complement but satisfies the postulates of Celani and Jansana’s strict implication. A canonical way of obtaining a weak implicative semilattice is by defining, on any pseudo-complemented semilattice, an implication via the term used by Prawitz to introduce the “classical” implication in his Ecumenical System. Likewise the term interpreting the “classical” disjunction within Prawitz’s system may be used to obtain a class of implicative semilattices enriched with a pseudo-disjunction, which is also one of our main object of study. In my talk I will emphasize these connections and discuss where they may lead in future research. For each of the above-mentioned new classes of algebras we have established a representation and a topological duality which generalize the known ones for Heyting algebras enriched with a nucleus. (slides)

This is joint work with Sergio Celani

Renato Leme

Abstract: Appearing first in the works of C. S. Peirce and L. Wittgenstein, truth tables soon become a synonym for propositional logic semantics. With the advent of intuitionistic propositional logic, however, more was needed. By rejecting the excluded middle principle, one gives up having a finite truth table interpretation for their operators. For a long time, this perception pushed away the efforts to characterize intuitionistic logic with truth tables. In 1932 Gödel proved that intuitionistic logic cannot be characterized by a single finite logical matrix. While non-deterministic matrices (nmatrices) were introduced in 2001 by A. Avron and I. Lev, it has an antecedent in the independent works of J. Kearns and J. Ivlev on modal logics. Kearns proposes a truth table characterization of modal systems S4 and S5 through 4-valued nmatrices with restriction on the valuation (level valuations) as an alternative to Kripke semantics. This method is nowadays called restricted nmatrices. Unfortunately, Kearns method does not provide a decision procedure for S4 and S5. To solve that, L. Grätz recently proposed a decision procedure for $T$ and $S4$ by refining Kearns approach. His method shows that one can evaluate modal systems with a 3-valued nmatrix, as long as one provides an appropriate (decidable) filter to delete some rows of the table. A natural extension to Grätz's technique is to use a restricted nmatrix to offer a decision procedure for intuitionistic propositional logic. We propose to do that with only one additional step, namely Gödel-McKinsey-Tarki's box translation. This technique can be extended to Prawitz's ecumenical logic. A computational implementation of these methods in Coq was also obtained. 

This is joint work with Marcelo Coniglio and Bruno Lopes

Dag Prawitz (unfortunately not coming)

Abstract: We speak of an ecumenical logical system when it replaces competing systems by unifying them into one system that contains the original systems as parts. Instead of seeing the original systems as being in conflict about which inferences are valid, one takes them to interpret the involved sentences differently and hence to be about different subject matters. The language of the ecumenical system must therefore duplicate some logical or descriptive constants occurring in the original constants, keeping them apart by writing them differently, and then attach meanings to them in a uniform way so that for each constant c in one of the original systems there is a corresponding constant c' in the ecumenical system with a meaning that agrees with how c was used in the original system. Linguistic meaning thus plays a crucial role when formulating an ecumenical system. I will discuss the kind of meaning theory that can be adequate for the purpose of setting up an ecumenical system.