Related papers: Algorithmic Correspondence for Hybrid Logic with B…
This work studies the application of the discrete Holder-Brascamp-Lieb (HBL) inequalities to the design of communication optimal algorithms. In particular, it describes optimal tiling (blocking) strategies for nested loops that lack data…
When reasoning about formal objects whose structures involve binding, it is often necessary to analyze expressions relative to a context that associates types, values, and other related attributes with variables that appear free in the…
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…
Given an algebra A we associate an incidence algebra A(\Sigma) and compare their Hochschild cohomology groups.
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
On any smooth algebraic variety over a $p$-adic local field, we construct a tensor functor from the category of de Rham $p$-adic \'etale local systems to the category of filtered algebraic vector bundles with integrable connections…
Recently, there has been a surge of interest in combining deep learning models with reasoning in order to handle more sophisticated learning tasks. In many cases, a reasoning task can be solved by an iterative algorithm. This algorithm is…
Extensive work has been done to determine necessary and sufficient conditions for a bijective correspondence of abelian extensions of number fields to force an isomorphism of the base fields. However, explicit examples of correspondences…
Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…
We employ appropriate realizations of the affine Hecke algebra and we recover previously known non-diagonal solutions of the reflection equation for the $U_{q}(\hat{gl_n})$ case. With the help of linear intertwining relations involving the…
We investigate Lie bialgebra structures on simple Lie algebras of non-split type $A$. It turns out that there are several classes of such Lie bialgebra structures, and it is possible to classify some of them. The classification is obtained…
In this paper, we deal with a calculus system SLCD (Syllogistic Logic with Carroll Diagrams), which gives a formal approach to logical reasoning with diagrams, for representations of the fundamental Aristotelian categorical propositions and…
In this article, a posteriori error analysis of the elliptic obstacle problem is addressed using hybrid high-order methods. The method involve cell unknowns represented by degree-$r$ polynomials and face unknowns represented by degree-$s$…
The Langlands correspondence for complex curves is traditionally formulated in terms of sheaves rather than functions. Recently, Langlands asked whether it is possible to construct a function-theoretic version. In this paper we use the…
Let A be an abelian category of finite type and homological dimension 1. Then by results of Green R(A), the extended Hall-Ringel algebra of A, has a natural Hopf algebra structure. We consider its Heisenberg double Heis(A) and study its…
In this paper we establish Springer correspondence for the symmetric pair $(\mathrm{SL}(N),\mathrm{SO}(N))$ using Fourier transform, parabolic induction functor, and a nearby cycle sheaves construction due to Grinberg. As applications, we…
The unified correspondence theory for distributive lattice expansion logics (DLE-logics) is specialized to strict implication logics. As a consequence of a general semantic consevativity result, a wide range of strict implication logics can…
We investigate the canonicity of inequalities of the intuitionistic mu-calculus. The notion of canonicity in the presence of fixed point operators is not entirely straightforward. In the algebraic setting of canonical extensions we examine…
In this paper, we define and study (co)homology theories of a compatible associative algebra $A$. At first, we construct a new graded Lie algebra whose Maurer-Cartan elements are given by compatible associative structures. Then we define…