Related papers: On the unification problem for GLP
Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…
We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, L, and take as input an algebra homomorphism f…
This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…
The paper is essentially a continuation of B.Plotkin, G.Zhitomirski, "Some logical invariants of algebras and logical relations between algebras", St.Peterburg Math. J., {19:5}, (2008) 859 -- 879, whose main notion is that of…
This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with…
Linear complementarity problems are a powerful tool for modeling many practically relevant situations such as market equilibria. They also connect many sub-areas of mathematics like game theory, optimization, and matrix theory. Despite…
This article discusses ability of Linear Programming models to be used as solvers of NP-complete problems. Integer Linear Programming is known as NP-complete problem, but non-integer Linear Programming problems can be solved in polynomial…
In this paper, we tackle the parametric complete multiplicity problem for a univariate polynomial. Our approach to the parametric complete multiplicity problem has a significant difference from the classical method, which relies on repeated…
Here we deal with the logic of [GuSh 533], which tries to capture polynomial time (for finite models). There it is proved that the logic cannot say much on models with equality only. Here we prove that it cannot say much on models for which…
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}$…
We consider the hardness of approximation of optimization problems from the point of view of definability. For many NP-hard optimization problems it is known that, unless P = NP, no polynomial-time algorithm can give an approximate solution…
A Geometric programming (GP) is a type of mathematical problem characterized by objective and constraint functions that have a special form. Many methods have been developed to solve large scale engineering design GP problems. In this paper…
Let $G$ be a connected and simply connected two-step nilpotent Lie group and $\Gamma$ a lattice subgroup of $G$. In this note, we give a new multiplicity formula, according to the sense of Moore, of irreducible unitary representations…
We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…
The interpolant existence problem (IEP) for a logic L is to decide, given formulas P and Q, whether there exists a formula I, built from the shared symbols of P and Q, such that P entails I and I entails Q in L. If L enjoys the Craig…
We extend the language of the classical syllogisms with the sentence-forms "At most 1 p is a q" and "More than 1 p is a q". We show that the resulting logic does not admit a finite set of syllogism-like rules whose associated derivation…
Uniform one-dimensional fragment UF1^= is a formalism obtained from first-order logic by limiting quantification to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the quantified…
The planar Kepler problem is complexified and we show that this holomorphic completely integrable Hamiltonian system has nontrivial monodromy.
Let G be a reductive group over an algebraically closed field k of separably good characteristic p>0 for G. Under these assumptions a Springer isomorphism from the reduced nilpotent scheme of the Lie algebra of G to the reduced unipotent…