Related papers: The weakest nontrivial idempotent equations
A variety of physical unknowables are discussed. Provable lack of physical omniscience, omnipredictability and omnipotence is derived by reduction to problems which are known to be recursively unsolvable. "Chaotic" symbolic dynamical…
In recent work, we introduced a new semantics for conditionals, covering a large class of what we call preconditionals. In this paper, we undertake an axiomatic study of preconditionals and subclasses of preconditionals. We then prove that…
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…
In this paper, a group is called weakly amenable if its left regular representation is not uniformly isolated from the trivial representation. First examples of finitely generated non-amenable weakly amenable groups are constructed.
Some superlinear fourth order elliptic equations are considered. Ground states are proved to exist and to concentrate at a point in the limit. The proof relies on variational methods, where the existence and concentration of nontrivial…
Consider the Schrodinger equation -\Delta u =(k+V) u in an infinite slab S= \R^{n-1}x (0,1), where V is a bounded potential supported on a set D of finite measure. We prove necessary conditions for the existence of nontrivial admissible…
Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as identifiers, annihilators, and…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
Additive relations are defined over additive monoids and additive operation is introduced over these new relations then we build algebraic system of equations. We can generate profuse equations by additive relations of two variables. To…
We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several…
The inviscid barotropic quasi-geostrophic equation with a free surface is considered. The free surface mandates a non-standard boundary condition. The global existence existence and uniqueness of a weak solution is established, thanks to…
An interesting observation is that most pairs of weakly homogeneous mappings have no strongly monotonic property, which is one of the key conditions to ensure the unique solvability of the generalized variational inequality. This paper…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…
On R^n endowed with a riemannian metric of bounded nonpositive curvature, the weakly convex closed subsets are topologically trivial. The stability of such subsets under intersection characterizes the euclidean spaces.
We consider the solution of systems of linear algebraic equations (SLAEs) with an ill-conditioned or degenerate exact matrix and an approximate right-hand side. An approach to solving such a problem is proposed and justified, which makes it…
We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a…
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 introduce a notion of quasi-weak equivalences associated with weak-equivalences in an exact category. It gives us a delooping for (idempotent complete) exact categories and a condition that the negative $K$-group of an exact category…
An abstract indefinite least squares problem with a quadratic constraint is considered. This is a quadratic programming problem with one quadratic equality constraint, where neither the objective nor the constraint are convex functions.…
As a generalization of nil clean ideal, we define weak nil clean ideal of a ring. An ideal $I$ of a ring $R$ is weak nil clean ideal if for any $x\in I$, either $x=e+n$ or $x=-e+n$, where $n$ is a nilpotent element and $e$ is an idempotent…