Abstract. For a first-order formula ϕ(x; y) we introduce and study the characteristic sequence Pn : n < ω of hypergraphs defined by Pn(y1, . . . , yn) := (∃x) i≤n ϕ(x; ...
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness ...
The aim of this paper is to survey and brie y discuss various rules of conditioning proposed in the framework of possibility theory as well as various conditional independence rel...
In this paper we describe the properties of independent components of optical ow of moving objects. Video sequences of objects seen by an observer moving at various angles, direct...
Marwan A. Jabri, Ki-Young Park, Soo-Young Lee, Ter...
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...