Theories with the independence property

A first-order theory T has the Independence Property provided T ⊢ (Q)(Φ⇒

A Unifying View on Recombination Spaces and Abstract Convex Evolutionary Search

This is the author accepted manuscript. The final version is available from Springer via the DOI in this record.Proceedings of EvoCOP 2019 - 19th European Conference on Evolutionary Computation, 24-26 April 2019, Leipzig, GermanyPrevious work proposed to unify an algebraic theory of fitness landscapes and a geometric framework of evolutionary algorithms (EAs). One of the main goals behind this unification is to develop an analytical method that verifies if a problem's landscape belongs to certain abstract convex landscapes classes, where certain recombination-based EAs (without mutation) have polynomial runtime performance. This paper advances such unification by showing that: (a) crossovers can be formally classified according to geometric or algebraic axiomatic properties; and (b) the population behaviour induced by certain crossovers in recombination-based EAs can be formalised in the geometric and algebraic theories. These results make a significant contribution to the basis of an integrated geometric-algebraic framework with which analyse recombination spaces and recombination-based EAs

Theory of convex structures

Presented in this monograph is the current state-of-the-art in the theory of convex structures. The notion of convexity covered here is considerably broader than the classic one; specifically, it is not restricted to the context of vector spaces. Classical concepts of order-convex sets (Birkhoff) and of geodesically convex sets (Menger) are directly inspired by intuition; they go back to the first half of this century. An axiomatic approach started to develop in the early Fifties. The author became attracted to it in the mid-Seventies, resulting in the present volume, in which graphs appear s

Theories with the Independence Property, Studia Logica 2010 95:379-405

A first-order theory T has the Independence Property provided deduction of a statement of type (quantifiers) (P -\u3e (P1 or P2 or .. or Pn)) in T implies that (quantifiers) (P -\u3e Pi) can be deduced in T for some i, 1 \u3c= i \u3c= n). Variants of this property have been noticed for some time in logic programming and in linear programming. We show that a first-order theory has the Independence Property for the class of basic formulas provided it can be axiomatized with Horn sentences. The existence of free models is a useful intermediate result. The independence Property is also a tool to decide that a sentence cannot be deduced. We illustrate this with the case of the classical Caratheodory theorem for Pasch-Peano geometries

Betweenness Spaces: Morphism and Aggregation Functions

The notion of betweenness space or of a convex structure is an abstraction of the standard notion of convexity in a linear space. We first consider a ternary betweenness relation that gives rise to an interval space structure and then we propose a more general definition of betweenness. We study morphism between abstract convex spaces and we characterize aggregation function that are monotone with respect to a betweenness relation

Preferences in Abstract Convex Structures

Convexity of preferences is a canonical assumption in economic theory. In this paper we study a generalized definition of convex preferences that relies on the notion of a convex space, that is an abstraction of the standard notion of convexity in a linear space. We introduce also betweenness relations that characterize convex spaces. First we consider a ternary betweenness relation that gives rise to an interval space structure and then we propose a more general definition of betweenness