Related papers: Logical Characterizations of Weighted Complexity C…
In this paper we investigate the relationships between a multipreferential semantics for defeasible reasoning in knowledge representation and a deep neural network model. Weighted knowledge bases for description logics are considered under…
We present a conceptual and uniform interpretation of the methods of integral representations of L-functions (period integrals, Rankin-Selberg integrals). This leads to: (i) a way to classify of such integrals, based on the classification…
Motivated by logarithmic conformal field theory and Gromov-Witten theory, we introduce a notion of a twisted module of a vertex algebra under an arbitrary (not necessarily semisimple) automorphism. Its main feature is that the twisted…
In this paper, we give a Nivat-like characterization for weighted alternating automata over commutative semirings (WAFA). To this purpose we prove that weighted alternating can be characterized as the concatenation of weighted finite tree…
This paper describes a paving by affines for regular nilpotent Hessenberg varieties in all Lie types, namely a kind of cell decomposition that can be used to compute homology despite its weak closure conditions. Precup recently proved a…
We consider the family of guarded and unguarded ordered logics, that constitute a recently rediscovered family of decidable fragments of first-order logic (FO), in which the order of quantification of variables coincides with the order in…
We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…
We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…
The purpose of this paper is to study sparse domination estimates of composition operators in the setting of complex function theory. The method originates from proofs of the $A_2$ theorem for Calder\'on-Zygmund operators in harmonic…
We show that it is possible to formulate gravity with a complex vierbein based on SL(2,C) gauge invariance. The proposed action is a four-form where the metric is not introduced but results as a function of the complex vierbein. This…
By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…
In this paper, we study different types of weighted Besov and Triebel-Lizorkin spaces with variable smoothness. The function spaces can be defined by means of the Littlewood-Paley theory in the field of Fourier analysis, while there are…
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of the non-uniform quantified constraint satisfaction problem…
Let G be a connected complex reductive group. A well known theorem of I. Losev's says that a smooth affine spherical G-variety X is uniquely determined by its weight monoid, which is the set of irreducible representations of G that occur in…
We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…
By using of analytical multi-logic expresses in conjunction with non-deterministic Turing machine the proposition was proved that algorithm of deterministic Turing counter machine of polynomial time complexity can be decreased to the…
The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…
Relaxed highest-weight modules play a central role in the study of many important vertex operator (super)algebras and their associated (logarithmic) conformal field theories, including the admissible-level affine models. Indeed, their…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form. But…