Related papers: On structural completeness vs almost structural co…
In this paper, motivated by the classical notion of a Strebel quadratic differential on a compact Riemann surfaces without boundary we introduce the notion of a quasi-Strebel structure for a meromorphic differential of an arbitrary order.…
In recent research on non-monotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P union R and Q union R have the same answer sets for any other program R. This…
It is proved that every prevariety of algebras is categorically equivalent to a "prevariety of logic", i.e., to the equivalent algebraic semantics of some sentential deductive system. This allows us to show that no nontrivial equation in…
Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…
We present a logical and algebraic description of right adjoint functors between generalized quasi-varieties, inspired by the work of McKenzie on category equivalence. This result is achieved by developing a correspondence between the…
In this note we settle some technical questions concerning finite rank quasi-free Hilbert modules and develop some useful machinery. In particular, we provide a method for determining when two such modules are unitarily equivalent. Along…
In recent years several classes of structured matrices are extended to classes of tensors in the context of tensor complementarity problem. The tensor complementarity problem is a class of nonlinear complementarity problem where the…
In this paper we systematically investigate the connections between logics with a finite number of variables, structures of bounded pathwidth, and linear Datalog Programs. We prove that, in the context of Constraint Satisfaction Problems,…
We study the problem of fitting ontologies and constraints to positive and negative examples that take the form of a finite relational structure. As ontology and constraint languages, we consider the description logics $\mathcal{E\mkern-2mu…
A $G$-grading on a complex semisimple Lie algebra $L$, where $G$ is a finite abelian group, is called quasi-good if each homogeneous component is 1-dimensional and 0 is not in the support of the grading. Analogous to classical root systems,…
In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well…
The quasi-variational inequalities play a significant role in analyzing a wide range of real-world problems. However, these problems are more complicated to solve than variational inequalities as the constraint set is based on the current…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
Recently, many structured tensors are defined and their properties are discussed in the literature. In this paper, we introduce a new class of structured tensors, called exceptionally regular tensor, which is relevant to the tensor…
We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity. By formalizing the problem in the language of coalgebraic…
We construct a convenient basis for all real semisimple Lie algebras by means of an adapted Chevalley basis of the complexification. It determines rational and in fact half-integer structure constants which we express only in terms of the…
It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.…
We start by constructing a new root system for rational triple singularities and determine the number of roots for each rational triple singularity. Then we show that, for each root, we obtain a linear free divisor. So we obtain a new…
Considering patterns as sets of their instances, a difference operator over patterns computes a finite set of two given patterns, which represents the difference between the dividend pattern and the divisor pattern. A complement of a…
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…