Semantics of weakening and contraction

DOI10.1016/0168-0072(94)90020-5zbMath0814.03007OpenAlexW2065261632MaRDI QIDQ1337357

Bart Jacobs

Publication date: 3 November 1994

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(94)90020-5

zbMATH Keywords

contractionlinear logicmonoidal categorymonadscategory of complete latticesshriek modalityweakening

Mathematics Subject Classification ID

Related Items (44)

Linear Logic Properly Displayed ⋮ Coalgebraic Components in a Many-Sorted Microcosm ⋮ Category-theoretic structure for independence and conditional independence ⋮ Combining algebraic effect descriptions using the tensor of complete lattices ⋮ Computational adequacy for recursive types in models of intuitionistic set theory ⋮ Relating two categorical models of term rewriting ⋮ On Coalgebras over Algebras ⋮ Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics ⋮ Quantale-Enriched Multicategories Via Actions ⋮ Functional distribution monads in functional-analytic contexts ⋮ Non-normal modal logics and conditional logics: semantic analysis and proof theory ⋮ From probability monads to commutative effectuses ⋮ Ambiguity and Incomplete Information in Categorical Models of Language ⋮ Dijkstra and Hoare monads in monadic computation ⋮ Universal Properties in Quantum Theory ⋮ A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics ⋮ From gs-monoidal to oplax cartesian categories: constructions and functorial completeness ⋮ An equational notion of lifting monad ⋮ Resource modalities in tensor logic ⋮ On coalgebras over algebras ⋮ Maximal traces and path-based coalgebraic temporal logics ⋮ Probabilistic systems coalgebraically: a survey ⋮ Reversible monadic computing ⋮ Unnamed Item ⋮ Domain theory for concurrency ⋮ A model of intuitionistic affine logic from stable domain theory ⋮ Domain-theoretical models of parametric polymorphism ⋮ Initial Algebras of Terms with Binding and Algebraic Structure ⋮ Game Semantics for Quantum Stores ⋮ Semimodule Enrichment ⋮ Partial Recursive Functions and Finality ⋮ Lawvere Categories as Composed PROPs ⋮ Affine Monads and Side-Effect-Freeness ⋮ Probabilities, distribution monads, and convex categories ⋮ Unnamed Item ⋮ Restriction categories. I: Categories of partial maps ⋮ Weakest preconditions in fibrations ⋮ Game Semantics for Quantum Data ⋮ From parametric polymorphism to models of polymorphic FPC ⋮ Structural induction and coinduction in a fibrational setting ⋮ Algebraic presentation of semifree monads ⋮ Lifting results for categories of algebras ⋮ Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic

Cites Work

• Linear logic
• *-autonomous categories. With an appendix by Po-Hsiang Chu
• On the unity of logic
• Notions of computation and monads
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Collapsed toposes and cartesian closed varieties
• A decidable fragment of predicate calculus
• Categories of partial maps
• Affine parts of monads
• Bounded linear logic: A modular approach to polynomial-time computability
• Monads on symmetric monoidal closed categories
• Strong functors and monoidal monads
• *-Autonomous categories and linear logic
• A new constructive logic: classic logic
• On Double Dualization Monads.
• Closed categories generated by commutative monads
• Bilinearity and Cartesian Closed Monads.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semantics of weakening and contraction