Related papers: A generic characterization of Pol(C)
Knowledge compilation (KC) languages find a growing number of practical uses, including in Constraint Programming (CP) and in Machine Learning (ML). In most applications, one natural question is how to explain the decisions made by models…
Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what…
We investigate relations on elements in C*-algebras, including *-polynomial relations, order relations and all relations that correspond to universal C*-algebras. We call these C*-relations and define them axiomatically. Within these are…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
In this paper we investigate the number of objects actually used in the terminating computations of a certain variant of polarizationless P systems with active membranes. The P systems we consider here have no in-communication rules and…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
Craig interpolation is a fundamental property of classical and non-classic logics with a plethora of applications from philosophical logic to computer-aided verification. The question of which interpolants can be obtained from an…
In this paper, approximation by means of algebraic polynomials of classes of functions defined by a generalised modulus of smoothness of operators of differentiation of these functions is considered. We give structural characteristics of…
In this paper, we consider a family of closed planar algebraic curves $\mathcal{C}$ which are given in parametrization form via a trigonometric polynomial $p$. When $\mathcal{C}$ is the boundary of a compact convex set, the polynomial $p$…
We prove that the isomorphism relation for separable C$^*$-algebras, and also the relations of complete and $n$-isometry for operator spaces and systems, are Borel reducible to the orbit equivalence relation of a Polish group action on a…
Extending the work of Freese, we further develop the theory of generalized trigonometric functions. In particular, we study to what extent the notion of polar form for the complex numbers may be generalized to arbitrary associative…
Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic finite automata with practical algorithms. The historical…
Probabilities of causation (PoC) are valuable concepts for explainable artificial intelligence and practical decision-making. PoC are originally defined for scalar binary variables. In this paper, we extend the concept of PoC to continuous…
We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…
We will investigate the norm closure of the unitary and similarity orbits of normal operators in unital, simple, purely infinite C*-algebras. An operator theoretic proof will be given to the classification of when two normal operators are…
We propose an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation. The key idea…
We show that a strong well-based cylindrical algebraic decomposition P of a bounded semi-algebraic set is a regular cell decomposition, in any dimension and independently of the method by which P is constructed. Being well-based is a global…
Let $C,A$ be countable abelian groups. In this paper we determine the complexity of classifying extensions $C$ by $A$, in the cases when $C$ is torsion-free and $A$ is a $p$-group, a torsion group with bounded primary components, or a free…
For commuting linear operators $P_0,P_1,..., P_\ell$ we describe a range of conditions which are weaker than invertibility. When any of these conditions hold we may study the composition $P=P_0P_1... P_\ell$ in terms of the component…
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal…