SearcharxivSearch

arXiv · 1204.0832

Theories without the tree property of the second kind

Abstract

We initiate a systematic study of the class of theories without the tree property of the second kind - NTP2. Most importantly, we show: the burden is "sub-multiplicative" in arbitrary theories (in particular, if a theory has TP2 then there is a formula with a single variable witnessing this); NTP2 is equivalent to the generalized Kim's lemma and to the boundedness of ist-weight; the dp-rank of a type in an arbitrary theory is witnessed by mutually indiscernible sequences of realizations of the type, after adding some parameters - so the dp-rank of a 1-type in any theory is always witnessed by sequences of singletons; in NTP2 theories, simple types are co-simple, characterized by the co-independence theorem, and forking between the realizations of a simple type and arbitrary elements satisfies full symmetry; a Henselian valued field of characteristic (0,0) is NTP2 (strong, of finite burden) if and only if the residue field is NTP2 (the residue field and the value group are strong, of finite burden respectively), so in particular any ultraproduct of p-adics is NTP2; adding a generic predicate to a geometric NTP2 theory preserves NTP2.

Explore related subjects

Keep this discovery

BibTeXRIS

Artem Chernikov. 2012-04-03. Theories without the tree property of the second kind. https://arxiv.org/abs/1204.0832

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