Related papers: A Braided Lambda Calculus
Justification logics are modal-like logics that provide a framework for reasoning about justifications. This paper introduces labeled sequent calculi for justification logics, as well as for hybrid modal-justification logics. Using the…
We use some Lie group theory and Budney's unitarization of the Lawrence-Krammer representation, to prove that for generic parameters of definite form the image of the representation (also on certain types of subgroups) is dense in the…
We interpret a recent formula for counting orbits of $GL(d,F_q)$ in terms of counting fixed points as addition in the affine braided line. The theory of such braided groups (or Hopf algebras in braided categories) allows us to obtain the…
A linear Gr-category is a category of finite-dimensional vector spaces graded by a finite group together with natural tensor product. We classify the braided monoidal structures of a class of linear Gr-categories via explicit computations…
We introduce a definition of braided tensor product $\operatorname{M}\overline{\boxtimes}\operatorname{N}$ of von Neumann algebras equipped with an action of a quasi-triangular quantum group $\mathbb{G}$ (this includes the case when…
This paper considers the challenges Large Language Models (LLMs) face when reasoning over text that includes information involving uncertainty explicitly quantified via probability values. This type of reasoning is relevant to a variety of…
Attention is focused on quantum spaces of physical importance, i.e. Manin plane, q-deformed Euclidean space in three or four dimensions as well as q-deformed Minkowski space. There are algebra isomorphisms that allow to identify quantum…
We introduce the concept of braided anti-flexible bialgebra and construct cocycle bicrossproduct anti-flexible bialgebras. As an application, we solve the extending problem for anti-flexible bialgebras by using some non-abelian cohomology…
Experts do not always feel very, comfortable when they have to give precise numerical estimations of certainty degrees. In this paper we present a qualitative approach which allows for attaching partially ordered symbolic grades to logical…
We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rules work on $\beta\eta$-equivalence classes of…
We study a classical realizability model (in the sense of J.-L. Krivine) arising from a model of untyped lambda calculus in coherence spaces. We show that this model validates countable choice using bar recursion and bar induction.
Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to measure to which extent two programs behave in a similar, although non equivalent, way.…
Presentations for unbraided, braided and symmetric pseudomonoids are defined. Biequivalences characterising the semistrict bicategories generated by these presentations are proven. It is shown that these biequivalences categorify results in…
A differential calculus of the first order over multi-braided quantum groups is developed. In analogy with the standard theory, left/right-covariant and bicovariant differential structures are introduced and investigated. Furthermore,…
The logic programming paradigm provides the basis for a new intensional view of higher-order notions. This view is realized primarily by employing the terms of a typed lambda calculus as representational devices and by using a richer form…
In this paper, we present a typed lambda calculus ${\bf SILL}(\lambda)_{\Sigma}$, a type-theoretic version of intuitionistic linear logic with subexponentials, that is, we have many resource comonadic modalities with some interconnections…
We give an exposition of the semantics of the simply-typed lambda-calculus, and its linear and ordered variants, using multi-ary structures. We define universal properties for multicategories, and use these to derive familiar rules for…
We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent…
After an overview of noncommutative differential calculus, we construct parts of it explicitly and explain why this construction agrees with a fuller version obtained from the theory of operads.
Multiplicative linear logic is a very well studied formal system, and most such studies are concerned with the one-sided sequent calculus. In this paper we look in detail at existing translations between a deep inference system and the…