Related papers: Conditional Logic is Complete for Convexity in the…
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…
Transparency is an essential requirement of machine learning based decision making systems that are deployed in real world. Often, transparency of a given system is achieved by providing explanations of the behavior and predictions of the…
This paper explores trivalent truth conditions for indicative conditionals, examining the "defective" table put forward by de Finetti 1936, as well as Reichenbach 1944, first sketched in Reichenbach 1935. On their approach, a conditional…
While a large body of work has scrutinized the meaning of conditional sentences, considerably less attention has been paid to formal models of their pragmatic use and interpretation. Here, we take a probabilistic approach to pragmatic…
This paper studies the configuration spaces of linkages whose underlying graph is a single cycle. Assume that the edge lengths are such that there are no configurations in which all the edges lie along a line. The main results are that,…
The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…
In this note we provide a simple proof of some properties enjoyed by convex functions having the engulfing property. In particular, making use only of results peculiar to convex analysis, we prove that differentiability and strict convexity…
We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that…
Let V be a set of number-theoretical functions. We define a notion of absolute V-realizability for predicate formulas and sequents in such a way that the indices of functions in V are used for interpreting the implication and the universal…
A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…
Admissible rules are shown to be conservatively preserved by the meet-combination of a wide class of logics. A basis is obtained for the resulting logic from bases given for the component logics. Structural completeness and decidability of…
We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…
The Erdos-Szekeres theorem states that for any natural k there is a natural number g(k) such that any set of at least g(k) points on a plane in general position contains a set of k points that are the extreme points of a convex polytope. We…
A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…
We consider scalar equilibrium problems governed by a bifunction in a finite-dimensional framework. By using classical arguments in Convex Analysis, we show that under suitable generalized convexity assumptions imposed on the bifunction,…
In this paper we study the interaction between logic and probability. In particular, we show that the convex hull of evaluations of a broad class of logics is always effectively axiomatizable. We define a Birkhoff-style calculus for…
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The main feature of this logic is the ability to limit the…
A convex geometry is finite zero-closed closure system that satisfies the anti-exchange property. Complexity results are given for two open problems related to representations of convex geometries using implication bases. In particular, the…
In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.