Related papers: On the Finiteness Problem for classes of modular l…
In this paper we consider propositional calculi, which are finitely axiomatizable extensions of intuitionistic implicational propositional calculus together with the rules of modus ponens and substitution. We give a proof of undecidability…
In the context of Hilbert's tenth problem, an outstanding open case is that of complex entire functions in one variable. A negative solution is known for polynomials (by Denef) and for exponential polynomials of finite order (by Chompitaki,…
We study the class of finite lattices that are isomorphic to the congruence lattices of algebras from a given finitely generated congruence-distributive variety. If this class is as large as allowed by an obvious necessary condition, the…
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…
We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…
In this paper we survey a number of recent results concerning the existence and moduli spaces of solutions of various geometric problems on noncompact manifolds. The three problems which we discuss in detail are: I. Complete properly…
It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…
In this paper, we count all non-isomorphic lattices on $n$ elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on…
We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a…
For the planar four-vortex problem, we show that there are finitely many stationary configurations consisting of equilibria, rigidly translating configurations, relative equilibria (uniformly rotating configurations) and collapse…
We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.
In this paper, we have considered second order non-homogeneous linear differential equations having entire coefficients. We have established conditions ensuring non-existence of finite order solution of such type of differential equations.
We study the multiplicative lattices L which satisfy the condition a = (a : (a : b))(a : b) for all a,b in L.
We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establish decidability for several fragments containing…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
In this article we study certain notions of `tameness' for the persistence modules studied in topological data analysis. In particular, we show that after adding infinitary points the so called finitely determined modules become finitely…
In this paper, we consider a fully nonlinear problem on manifolds with boundaries of negative admissible curvatures. As a consequence, we conclude the existence of certain types of metrics on the general differential manifolds with…
The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…
The classification of lattice equations that are integrable in the sense of higher-dimensional consistency is extended by allowing directed edges. We find two cases that are not transformable via the 'admissible transformations' to the…
We extend a recent result of McKenzie, and show that it is an undecidable problem to determine if 4 appears in the typeset of a finitely generated, locally finite variety.