SearcharxivSearch

arXiv · 2308.01801

Generic stability, randomizations, and NIP formulas

Abstract

We prove a number of results relating the concepts of Keisler measures, generic stability, randomizations, and NIP formulas. Among other things, we do the following: (1) We introduce the notion of a Keisler-Morley measure, which plays the role of a Morley sequence for a Keisler measure. We prove that if $\mu$ is fim over $M$, then for any Keisler-Morley measure $\lambda$ in $\mu$ over $M$ and any formula $\varphi(x,b)$, $\lim_{i \to \infty} \lambda(\varphi(x_i,b)) = \mu(\varphi(x,b))$. We also show that any measure satisfying this conclusion must be fam. (2) We study the map, defined by Ben Yaacov, taking a definable measure $\mu$ to a type $r_\mu$ in the randomization. We prove that this map commutes with Morley products, and that if $\mu$ is fim then $r_\mu$ is generically stable. (3) We characterize when generically stable types are closed under Morley products by means of a variation of ict-patterns. Moreover, we show that NTP$_2$ theories satisfy this property. (4) We prove that if a local measure admits a suitably tame global extension, then it has finite packing numbers with respect to any definable family. We also characterize NIP formulas via the existence of tame extensions for local measures.

Explore related subjects

Keep this discovery

BibTeXRIS

Gabriel Conant, Kyle Gannon, James E. Hanson. 2023-08-03. Generic stability, randomizations, and NIP formulas. https://arxiv.org/abs/2308.01801

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