Related papers: Algorithmic Correspondence for Hybrid Logic with B…
Reasoning under uncertainty is a fundamental challenge in Artificial Intelligence. As with most of these challenges, there is a harsh dilemma between the expressive power of the language used, and the tractability of the computational…
Much of algebra and representation theory can be formulated in the general framework of tensor categories. The aim of this paper is to further develop this theory for braided tensor categories. Several results are established that do not…
We establish a relative Riemann-Hilbert correspondence for Alexander complexes (also known as Sabbah specialization complexes) by using relative regular holonomic $\mathscr D$-modules in an equivariant way, which particularly gives a…
We interpret the construction of relative Cuntz-Pimsner algebras of correspondences in terms of the correspondence bicategory, as a reflector into a certain sub-bicategory. This generalises a previous characterisation of absolute…
By fundamental results of Sch\"utzenberger, McNaughton and Papert from the 1970s, the classes of first-order definable and aperiodic languages coincide. Here, we extend this equivalence to a quantitative setting. For this, weighted automata…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
We solve two problems in the theory of correspondences that have important implications in the theory of product systems. The first problem is the question whether every correspondence is the correspondence associated (by the representation…
We investigate the first-order theory of closed subspaces of complex Hilbert spaces in the signature $(\lor,\perp,0,1)$, where `$\perp$' is the orthogonality relation. Our main result is that already its quasi-identities are undecidable:…
Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for both logical and computational reasons. On the other hand,…
Hybrid logic extends modal logic with special propositions called nominals, each of which is true at only one state in a model. This enables us to describe some properties of binary relations, such as irreflexivity and anti-symmetry, which…
We construct a class of representations of the Heisenberg algebra in terms of the complex shift operators subject to the proper continuous limit imposed by the correspondence principle. We find a suitable Hilbert space formulation of our…
A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…
For a connected semisimple Lie group $G$ we describe an explicit collection of correspondences between the admissible dual of $G$ and the admissible dual of the Cartan motion group associated with $G$. We conjecture that each of these…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
Proofs by logical relations play a key role to establish rich properties such as normalization or contextual equivalence. They are also challenging to mechanize. In this paper, we describe the completeness proof of algorithmic equality for…
The Hodge-FVH correspondence establishes a relationship between the special cubic Hodge integrals and an integrable hierarchy, which is called the fractional Volterra hierarchy. In this paper we prove this correspondence. As an application…
A variety of logical frameworks support the use of higher-order abstract syntax in representing formal systems; however, each system has its own set of benchmarks. Even worse, general proof assistants that provide special libraries for…
Bijective correspondences are established between (1) silting objects, (2) simple-minded collections, (3) bounded $t$-structures with length heart and (4) bounded co-$t$-structures. These correspondences are shown to commute with mutations.…
We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…
We survey the notion and history of error-correcting codes and the algorithms needed to make them effective in information transmission. We then give some basic as well as more modern constructions of, and algorithms for, error-correcting…