Abstract is missing.
- Amalgamation Property for Varieties of BL-algebras Generated by One Chain with Finitely Many ComponentsStefano Aguzzoli, Matteo Bianchi 0001. 1-18 [doi]
- Unary-Determined Distributive ℓ-magmas and Bunched Implication AlgebrasNatanael Alpay, Peter Jipsen, Melissa Sugimoto. 19-36 [doi]
- Effect Algebras, Girard Quantales and Complementation in Separation LogicCallum Bannister, Peter Höfner, Georg Struth. 37-53 [doi]
- Relational Computation of Sets of RelationsRudolf Berghammer. 54-71 [doi]
- Experimental Investigation of Sufficient Criteria for Relations to Have KernelsRudolf Berghammer, Mitja Kulczynski. 72-89 [doi]
- ℓ r-Multisemigroups, Modal Quantales and the Origin of LocalityCameron Calk, Uli Fahrenberg, Christian Johansen, Georg Struth, Krzysztof Ziemianski. 90-107 [doi]
- Abstract Strategies and CoherenceCameron Calk, Eric Goubault, Philippe Malbos. 108-125 [doi]
- Algorithmic Correspondence for Relevance Logics, Bunched Implication Logics, and Relation Algebras via an Implementation of the Algorithm PEARLWillem Conradie, Valentin Goranko, Peter Jipsen. 126-143 [doi]
- The Class of Representable Semilattice-Ordered Monoids Is Not a VarietyAmina Doumane. 144-158 [doi]
- Accretive Computation of Global TransformationsAlexandre Fernandez, Luidnel Maignan, Antoine Spicher. 159-175 [doi]
- Some Modal and Temporal Translations of Generalized Basic LogicWesley Fussner, William Javier Zuluaga Botero. 176-191 [doi]
- Isolated Sublattices and Their Application to Counting Closure OperatorsRoland Glück. 192-208 [doi]
- Second-Order Properties of Undirected GraphsWalter Guttmann. 209-224 [doi]
- Relation-Algebraic Verification of Borůvka's Minimum Spanning Tree AlgorithmWalter Guttmann, Nicolas Robinson-O'Brien. 225-240 [doi]
- Deciding FO-definability of Regular LanguagesAgi Kurucz, Vladislav Ryzhikov, Yury Savateev, Michael Zakharyaschev. 241-257 [doi]
- Relational Models for the Lambek Calculus with Intersection and UnitStepan L. Kuznetsov. 258-274 [doi]
- Free Modal Riesz Spaces are Archimedean: A Syntactic ProofChristophe Lucas, Matteo Mio. 275-291 [doi]
- Polyadic Spaces and Profinite MonoidsJérémie Marquès. 292-308 [doi]
- Time Warps, from Algebra to AlgorithmsSam van Gool, Adrien Guatto, George Metcalfe, Simon Santschi. 309-324 [doi]
- On Algebra of Program Correctness and IncorrectnessBernhard Möller, Peter W. O'Hearn, Tony Hoare. 325-343 [doi]
- Computing Least and Greatest Fixed Points in Absorptive SemiringsMatthias Naaf. 344-361 [doi]
- A Variety Theorem for Relational Universal AlgebraChad Nester. 362-377 [doi]
- On Tools for Completeness of Kleene Algebra with HypothesesDamien Pous, Jurriaan Rot, Jana Wagemaker. 378-395 [doi]
- Skew Metrics Valued in Sugihara SemigroupsLuigi Santocanale. 396-412 [doi]
- Computing Distributed Knowledge as the Greatest Lower Bound of KnowledgeCarlos Pinzón, Santiago Quintero, Sergio Ramírez, Frank Valencia. 413-432 [doi]
- Relational Sums and Splittings in Categories of L-fuzzy RelationsMichael Winter. 433-447 [doi]
- Change of Base Using Arrow CategoriesMichael Winter. 448-464 [doi]
- Automated Reasoning for Probabilistic Sequential Programs with Theorem ProvingKangfeng Ye, Simon Foster 0001, Jim Woodcock. 465-482 [doi]
- Domain Range Semigroups and Finite RepresentationsJas Semrl. 483-498 [doi]