SearcharxivSearch

arXiv · 1311.3806

Measuring dependence in metric abstract elementary classes with perturbations

Abstract

We define and study a metric independence notion in a homogeneous metric abstract elementary class with perturbations that is $d^p$-superstable (superstable wrt. the perturbation topology), weakly simple and has complete type spaces and we give a new example of such a class based on B. Zilber's approximations of Weyl algebras. We introduce a way to measure the dependence of a tuple $a$ from a set $B$ over another set $A$. We prove basic properties of the notion, e.g. that $a$ is independent of $B$ over $A$ in the usual sense of homogeneous model theory if and only if the measure of dependence is $<\varepsilon$ for all $\varepsilon >0$. As an example of our measure of dependence we show a connection between the measure and entropy in models from quantum mechanics in which the spectrum of the observable is discrete. As an application, we show that weak simplicity implies a very strong form of simplicity and study the question of when the dependence inside a set of all realisations of some type can be seen to arise from a pregeometry in cases when the type is not regular. In the end of the paper, we demonstrate our notions and results in one more example: a class built from the $p$-adic integers.

Explore related subjects

Keep this discovery

BibTeXRIS

Åsa Hirvonen, Tapani Hyttinen. 2016-01-05. Measuring dependence in metric abstract elementary classes with perturbations. https://arxiv.org/abs/1311.3806

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO