Axe transverse LOGIQUES du LIRMM

• chaque 14 janvier journées mondiales de la logique (UNESCO)
  
  
• 10-21 February 2025 FLAMANT 2025 Workshop The 1st European Workshop on Formal Logic At Montpellier ANd database Theory  (D. Carral)
  
• 10 décembre 2024 Journée sous typage (V. Blazy, Ch. Retoré)
  
• 11-12 juillet 2024 Workshop Logic at the Interface Modal Logic and AI (BayFrance project, Bamberg-Montpellier, Mendler, Burke, Sioutis, Retoré)
  
• 15 janvier 2024 journée pour les 60 ans de Christian Retoré (au lieu de la journée mondiale de la logique)
  
• 13-14 décembre 2023 20e journées de Combinatoire et d'Algorithmes du Littoral Méditerrannéen JCAML thème en 2023 "logique et algorithmes de  graphes"
  
• 23 mai 2023 Deux exposés dans le cadre de l'axe transverses logiques, invités par Michael Sioutis (Coconut)
  
• 14h Michael MENDLER  (Universität Bamberg) THE DOŠEN SQUARE UNDER CONSTRUCTION: A TALE OF FOUR MODALITIES
  In classical modal logic, necessity []A, possibility <>A, impossibility []~A and non-necessity <>~A form a Square of Oppositions (SO) whose corners are interdefinable using classical negation.The relationship between these modalities in intuitionistic modal logic is a more delicate matter since negation is weaker. Intuitionistic non-necessity [~] and impossibility <~>, first investigated by Došen, have received less attention and— together with their positive counterparts [] and <> —form a square we call the Došen Square. Unfortunately, the core property of constructive logic, the Disjunction Property (DP), fails when the modalities are combined and, interpreted in birelational Kripke structures à la Došen, the Square partially collapses. We introduce the constructive logic CKD, whose four semantically independent modalities [], <>, [~], <~> prevent the Došen Square from collapsing under the effect of intuitionistic negation while preserving DP. The model theory of CKD involves a constructive Kripke frame interpretation of the modalities. A Hilbert deduction system and an equivalent cut-free sequent calculus are presented. Soundness, completeness and finite model property are proven, implying that CKD is decidable. The logics HK[~], HK[], HK<> and HK<~> of Došen and other known theories of intuitionistic modalities are syntactic fragments or axiomatic extensions of CKD.
  
• 16h Luke BURKE (Universität Bamberg) HYPE, NATURAL LANGUAGE SEMANTICS AND NEGATIVE MODAL OPERATORS
  The logic HYPE has been advocated as a suitable framework with which to pursue `hyperintensional' semantics. HYPE is one of a number of logics in which negation is treated as a modal operator over states which stand in some special relation of compatibility with the state of evaluation. I show how HYPE can be used in the context of natural language semantics, presenting various applications and (possibly, given time) illustrating some tools and techniques (monads, applicatives) which are useful in combining different kinds of semantic value (and independent of HYPE).
  
• 14 mars 2023 Exposé ECO ESCAPE dans le cadre de l'axe transverse "logiques" Matthias BAAZ (TU Wien) THE REALM OF QUANTIFIERS 
  In this lecture we classify quantifiers according to non-emptiness (i.e. always an object is denoted and according to dimension. For non-empty quantifiers Skolemization and some sort of epsilon calculus is always possible. This is not possible for empty quantifiers however positive results concerning eg the prenex fragment are possible (We choose as most natural example in this respect Gödel quantifiers.) Furthermore we classify quantifiers after dimension and show that in a proof-theoretic aspect global views on proofs which contradict Hilbert's pardigma are necessary. This holds for quantifier macros and a fortiori for (partialcalculi for) Henkin quantifiers.
  
• 17 février 2023 Workshop Leveraging graph complexity measures to ensure decidability of first-order logic reasoning
  
• 21-22 novembre 2022 Workshop on Logic, Graphs, and Algorithms (LoGAlg 2022) is a two-day event held at LIRMM (Montpellier) during the dates 21 and 22 of November 2022. The workshop will be dedicated to the logical aspects of graph algorithms and their diverse applications in Theoretical Computer Science and Discrete Mathematics.
  
• 2 juin 2022 exposé  Des logiques formelles aux applications dans les mondes scientifiques et industriels par Gérard Berry professeur émérite au collège de France, chaire Algorithmes  Machines et Langages
• 23-24 novembre 2021 journées logique et interaction
  
• 17 novembre 2021 journée fragments décidables de la logique du premier ordre organisée par D. Carral
• 4 juin 2021 journée preuves
  
• 22 janvier 2021 journée logique linéaire réseaux de preuves   dans le cadre du GDR-I logique linéaire organisée par D. Catta
  
• 10 avril 2018 séminaire HiPhiS La formalisation des preuves, quelles propriétés intrinsèques? Michel PARIGOT (CNRS, IRIF)
  
• 2017 projet Quanti de l'université de Montpellier journées (11 juillet, 8 et 15 décembre) et workshop (17-21 juillet)
  
• 22 mai 2017 A calculus for sweet sixteen Reinhard MUSKENS (Univ Tilburg)
  
• 26 février 2017 Completeness proofs for intuitionnisitic logic on opens of R^n David Duque-Fernandez (Univ Toulouse III - Univ Ghent)
  
• 5 juillet 2016 Modern Type Theories with Applications to Natural Language Semantics Zhaohui LUO (Royal Holloway College, Univ London)
  
• 9 février 2016 séminaire HiPhis Complexité Algorithmique: un point de vue logique. Arnaud DURAND (Univ Paris Cité)
  
• 9 novembre 2015 Hilbert's epsilon Matthias BAAZ (TU Wien)
  
• 10-11-12 juin 2015 workshop Espilon and Tau in Logic, Linguistics and Informatics (actes) juin 2015 (organised by S. Chatzikyriakydis, F. Pasquali, Ch Retoré)
•