Convolution Algebras: Relational Convolution, Generalised Modalities and Incidence Algebras

Convolution is a ubiquitous operation in mathematics and computing. The Kripke semantics for substructural and interval logics motivates its study for quantale-valued functions relative to ternary relations. The resulting notion of relational convolution leads to generalised binary and unary modal operators for qualitative and quantitative models, and to more conventional variants, when ternary relations arise from identities over partial semigroups. Convolution-based semantics for fragments of categorial, linear and incidence (segment or interval) logics are provided as qualitative applications. Quantitative examples include algebras of durations and mean values in the duration calculus.

[1]  Dominic R. Verity,et al.  ∞-Categories for the Working Mathematician , 2018 .

[2]  Zhou Chaochen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems , 2004 .

[3]  K. I. Rosenthal.  Quantales and their applications , 1990 .

[4]  Bernhard Möller,et al.  An algebra of hybrid systems , 2009, J. Log. Algebraic Methods Program..

[5]  Georg Struth,et al.  Modal Kleene Algebra Applied to Program Correctness , 2016, FM.

[6]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[7]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[8]  Georg Struth,et al.  Hybrid process algebra , 2005, J. Log. Algebraic Methods Program..

[9]  Jakub Michaliszyn,et al.  The Ultimate Undecidability Result for the Halpern-Shoham Logic , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[10]  Sammie Bae,et al.  Graphs , 2020, Algorithms.

[11]  Dominique Larchey-Wendling,et al.  Expressivity properties of boolean BI through relational models , 2006 .

[12]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[13]  J. Berstel,et al.  Les séries rationnelles et leurs langages , 1984 .

[14]  Georg Struth,et al.  Relational Semigroups and Object-Free Categories , 2020, ArXiv.

[15]  Szabolcs Mikulás,et al.  Lambek Calculus and its relational semantics: Completeness and incompleteness , 1994, J. Log. Lang. Inf..

[16]  GondranM.,et al.  Dioïds and semirings , 2007 .

[17]  Ben C. Moszkowski,et al.  A Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time , 2012, Log. Methods Comput. Sci..

[18]  Georg Struth,et al.  Kleene algebra with domain , 2003, TOCL.

[19]  Georg Struth,et al.  Convolution as a Unifying Concept , 2016, ACM Trans. Comput. Log..

[20]  Arnon Avron,et al.  What is relevance logic? , 2014, Ann. Pure Appl. Log..

[21]  J. Goguen.  L-fuzzy sets , 1967 .

[22]  Yde Venema,et al.  Expressiveness and Completeness of an Interval Tense Logic , 1990, Notre Dame J. Formal Log..

[23]  G. Rota.  On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[24]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[25]  Richard Moot,et al.  The Logic of Categorial Grammars , 2012, Lecture Notes in Computer Science.

[26]  Georg Struth,et al.  Algebraic Principles for Rely-Guarantee Style Concurrency Verification Tools , 2013, FM.

[27]  Editors , 2003 .

[28]  Chaochen Zhou,et al.  Completeness of Neighbourhood Logic , 1999, STACS.

[29]  Chaochen Zhou,et al.  A Duration Calculus with Infinite Intervals , 1995, FCT.

[30]  Savas Konur,et al.  A survey on temporal logics for specifying and verifying real-time systems , 2013, Frontiers of Computer Science.

[31]  Andrew Lesniewski,et al.  Noncommutative Geometry , 1997 .

[32]  Georg Struth,et al.  Quantales , 2018, Arch. Formal Proofs.

[33]  Yde Venema,et al.  A Modal Logic for Chopping Intervals , 1991, J. Log. Comput..

[34]  Y. S. Ramakrishna,et al.  Recursive Mean-Value Calculus , 1998, FSTTCS.

[35]  Bolyai János Matematikai Társulat,et al.  Algebraic theory of semigroups , 1979 .

[36]  Georg Struth,et al.  Partial Semigroups and Convolution Algebras , 2017, Arch. Formal Proofs.

[37]  Zohar Manna,et al.  Reasoning in Interval Temporal Logic , 1983, Logic of Programs.

[38]  Valentin Goranko,et al.  A Road Map of Interval Temporal Logics and Duration Calculi , 2004, J. Appl. Non Class. Logics.

[39]  Georg Struth,et al.  A Program Construction and Verification Tool for Separation Logic , 2015, MPC.

[40]  Bernhard Möller,et al.  Algebraic Neighbourhood Logic , 2008, J. Log. Algebraic Methods Program..

[41]  Valentin Goranko,et al.  Interval Temporal Logics: a Journey , 2013, Bull. EATCS.

[42]  Georg Struth,et al.  Convolution and Concurrency , 2020, Math. Struct. Comput. Sci..

[43]  J. Conway.  Regular algebra and finite machines , 1971 .

[44]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[45]  J. Lambek.  The Mathematics of Sentence Structure , 1958 .

[46]  Gerard Allwein,et al.  Kripke models for linear logic , 1993, Journal of Symbolic Logic.

[47]  Kosta Dosen,et al.  A Brief Survey of Frames for the Lambek Calculus , 1992, Math. Log. Q..

[48]  D. Foulis,et al.  Effect algebras and unsharp quantum logics , 1994 .

[49]  Georg Struth,et al.  Building program construction and verification tools from algebraic principles , 2015, Formal Aspects of Computing.

[50]  Gheorghe Paun,et al.  The Oxford Handbook of Membrane Computing , 2010 .

[51]  Steven J. Vickers,et al.  Quantales, observational logic and process semantics , 1993, Mathematical Structures in Computer Science.

[52]  A. Clifford,et al.  The algebraic theory of semigroups , 1964 .

[53]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[54]  John Harding,et al.  The convolution algebra , 2017, 1702.02847.

[55]  W. Heisenberg.  Über quantentheoretische Umdeutung kinematischer und mechanischer Beziehungen , 1925 .

[56]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[57]  K. I. Rosenthal.  Relational monoids, multirelations, and quantalic recognizers , 1997 .