Related papers: Geometric Nontermination Arguments
We generalize the validity criterion for the infinitary proof system of the multiplicative additive linear logic with fixed points. Our criterion is designed to take into account axioms and cuts. We show that it is sound and enjoys the cut…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
We provide nonlinear realization of supergravity with an arbitrary number of supersymmetries by means of coset construction. The number of gravitino degrees of freedom counts the number of supersymmetries, which will be possibly probed in…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
The pursue of what are properties that can be identified to permit an automated reasoning program to generate and find new and interesting theorems is an interesting research goal (pun intended). The automatic discovery of new theorems is a…
In this paper we are concerned with a Gordan-type theorem involving an arbitrary number of inequality functions. We not only state its validity under a weak convexity assumption on the functions, but also show it is an optimal result. We…
We study the tracking of a trajectory for a nonholonomic system by recasting the problem as an optimal control problem. The cost function is chosen to minimize the error in positions and velocities between the trajectory of a nonholonomic…
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…
In this note, we present a probabilistic proof of the well-known finite geometric series. The proof follows by taking the moments of the sum and the difference of two independent exponentially distributed random variables.
In this survey article we discuss a framework of noncommutative geometry with differential graded categories as models for spaces. We outline a construction of the category of noncommutative spaces and also include a discussion on…
Each relational structure X has an associated Gaifman graph, which endows X with the properties of a graph. Suppose that X is infinite, connected and of bounded degree. A first-order sentence in the language of X is almost surely true…
A nonconstructive proof can be used to prove the existence of an object with some properties without providing an explicit example of such an object. A special case is a probabilistic proof where we show that an object with required…
The aim of this paper is to give an existence result for a class of one-dimensional, non-convex, non-coercive problems in the Calculus of Variations. The main tools for the proof are an existence theorem in the convex case and the closure…
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…
In this paper, we consider an approach introduced in term rewriting for the automatic detection of non-looping non-termination from patterns of rules. We adapt it to logic programming by defining a new unfolding technique that produces…
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…
In this paper the geometric mean of partial positive definite matrices with missing entries is considered. The weighted geometric mean of two sets of positive matrices is defined, and we show whether such a geometric mean holds certain…
Tiwari proved that termination of linear programs (loops with linear loop conditions and updates) over the reals is decidable through Jordan forms and eigenvectors computation. Braverman proved that it is also decidable over the integers.…
The projection lemma (often also referred to as the elimination lemma) is one of the most powerful and useful tools in the context of linear matrix inequalities for system analysis and control. In its traditional formulation, the projection…
Linear constraints are the linear counterpart of Haskell's class constraints. Linearly typed parameters allow the programmer to control resources such as file handles and manually managed memory as linear arguments. Indeed, a linear type…