Related papers: Definable closure in randomizations

Any strategy and prior probability together are a coherent conditional probability that can be extended, generally not in a unique way, to a full conditional probability. The corresponding class of extensions is studied and a closed form…

Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis (1973) earlier considered such a notion of relative likelihood in the…

The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map…

We introduce the notion of limiting theories, giving examples and providing a sufficient condition under which the first order theory of a structure is the limit of the first order theories of a collection of substructures. We also give a…

We define a discrete closure operation for definably complete locally o-minimal structures $\mathcal M$. The pair of the underlying set of $\mathcal M$ and the discrete closure operation forms a pregeometry. We define the rank of a…

Life continuously changes its own components and states at each moment through interaction with the external world, while maintaining its own individuality in a cyclical manner. Such a property, known as "autonomy," has been formulated…

In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…

We define a closure operation for ideals in a commutative ring which has all the good properties of solid closure (at least in the case of equal characteristic) but such that also every ideal in a regular ring is closed. This gives in…

We examine sorting algorithms for $n$ elements whose basic operation is comparing $t$ elements simultaneously (a $t$-comparator). We focus on algorithms that use only a single round or two rounds -- comparisons performed in the second round…

The set of all m-tuples of compatible full conditional distributions on discrete random variables is an algebraic set whose defining ideal is a unimodular toric ideal. We identify the defining polynomials of these ideals with closed walks…

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

In this paper we show that the closure of a random sample for a k-dimensional random vector is almost surely a deterministic set of all heavy points of the distribution. A heavy point is defined to be a point for which all its neighborhoods…

We describe the ind- and pro- categories of the category of definable sets, in some first order theory, in terms of points in a sufficiently saturated model.

We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph…

Some considerations showing that renormalizable theories with consistent perturbative theries can not be nonperturbatively finite (in terms of bare parameters) are provided. Accordingly any fundamental unified theory has to be either non…

Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t functions, and let T be the smallest t for which g_t is…

Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…

A different general philosophy, to be called Full Randomness (FR), for the analysis of random effects models is presented, involving a notion of reducing or preferably eliminating fixed effects, at least formally. For example, under FR…

We present a first-order theorem proving framework for establishing the correctness of functional programs implementing sorting algorithms with recursive data structures. We formalize the semantics of recursive programs in many-sorted…

The quantization scheme in probability theory deals with finding a best approximation of a given probability distribution by a probability distribution that is supported on finitely many points. In this paper, first we state and prove a…