Related papers: Logical Characterizations of Weighted Complexity C…
We study the structure and representation theory of the principal W-algebra $\mathsf{W}^{\mathsf{k}}_{\mathrm{pr}}$ of $\mathsf{V}^{\mathsf{k}}(\mathfrak{psl}_{2|2})$. The defining operator product expansions are computed, as is the Zhu…
We introduce some notions of invariant elementary definability which extend the notions of first-order order-invariant definability, and, more generally, definability invariant with respect to arbitrary numerical relations. In particular,…
We construct families of commutative (super) algebra objects in the category of weight modules for the unrolled restricted quantum group $\overline{U}_q^H(\mfg)$ of a simple Lie algebra $\mfg$ at roots of unity, and study their categories…
We study hidden-variable models from quantum mechanics, and their abstractions in purely probabilistic and relational frameworks, by means of logics of dependence and independence, based on team semantics. We show that common desirable…
In this paper we introduce constructible analogs of the discrete complexity classes $\mathbf{VP}$ and $\mathbf{VNP}$ of sequences of functions. The functions in the new definitions are constructible functions on $\mathbb{R}^n$ or…
We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $\Pi$-types, weak and strong $\Sigma$-types, natural numbers, an empty type, and a…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
In this paper, monic polynomials orthogonal with deformation of the Freud-type weight function are considered. These polynomials fullfill linear differential equation with some polynomial coefficients in their holonomic form. The aim of…
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…
We introduce an extension of fixed-point logic ($\mathsf{FP}$) with a group-order operator ($\mathsf{ord}$), that computes the size of a group generated by a definable set of permutations. This operation is a generalization of the rank…
We consider logic-based argumentation in which an argument is a pair (Fi,al), where the support Fi is a minimal consistent set of formulae taken from a given knowledge base (usually denoted by De) that entails the claim al (a formula). We…
We consider correlation functions for the Wess-Zumino-Witten model on the torus with the insertion of a Cartan element; mathematically this means that we consider the function of the form $F=\Tr (\Phi_1 (z_1)\ldots \Phi_n…
We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…
Let ${\cal L}$ be a variation of Hodge structures on the complement $X^{*}$ of a normal crossing divisor (NCD) $ Y$ in a smooth analytic variety $X$ and let $ j: X^{*} = X - Y \to X $ denotes the open embedding. The purpose of this paper is…
We consider a weighted family of $n$ parallelly transported hyperplanes in a $k$-dimensioinal affine space and describe the characteristic variety of the Gauss-Manin differential equations for associated hypergeometric integrals. The…
This paper introduces and systematically studies Weyl-type, Witt-type, and non-associative algebras defined over expolynomial rings -- commutative rings generated by exponential functions $e^{\alpha x}$, exponentials of exponentials $e^{\pm…
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a…
Weighted automata is a basic tool for specification in quantitative verification, which allows to express quantitative features of analysed systems such as resource consumption. Quantitative specification can be assisted by automata…
Affine continuous logic is extended to affine integration logic. Affine compactness theorem is proved by both the ultramean construction and Henkin's method. Also, a proof system and a completeness theorem are given. An appropriate variant…
Given a smooth algebraic variety X with an action of a connected reductive linear algebraic group G, and an equivariant D-module M, we study the G-decompositions of the associated V-, Hodge, and weight filtrations. If M is the localization…