Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2306.08239

Bi-invariant types, reliably invariant types, and the comb tree property

James E. Hanson
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce and examine some special classes of invariant types$\unicode{x2014}$bi-invariant, strongly bi-invariant, extendibly invariant, and reliably invariant types$\unicode{x2014}$and show that they are related to certain model-theoretic tree properties. We show that the comb tree property (recently introduced by Mutchnik) is equivalent to the failure of Kim's lemma for bi-invariant types and is implied by the failure of Kim's lemma for reliably invariant types over invariance bases. We show that every type over an invariance base extends to a reliably invariant type$\unicode{x2014}$generalizing an unpublished result of Kruckman and Ramsey$\unicode{x2014}$and use this to show that, under a reasonable definition of Kim-dividing, Kim-forking coincides with Kim-dividing over invariance bases in theories without the comb tree property. Assuming a measurable cardinal, we characterize the comb tree property in terms of a form of dual local character. We also show that the antichain tree property (introduced by Ahn and Kim) seems to have a somewhat similar relationship to strong bi-invariance. In particular, we show that NATP theories satisfy Kim's lemma for strongly bi-invariant types and (assuming a measurable cardinal) satisfy a different form of dual local character. Furthermore, we examine a mutual generalization of the local character properties satisfied by NTP$_2$ and NSOP$_1$ theories and show that it is satisfied by all NATP theories. Finally, we give some related minor results$\unicode{x2014}$a strengthened local character characterization of NSOP$_1$ and a characterization of coheirs in terms of invariant extensions in expansions$\unicode{x2014}$as well as a pathological example of Kim-dividing.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

James E. Hanson. 2023-06-14. Bi-invariant types, reliably invariant types, and the comb tree property. https://arxiv.org/abs/2306.08239

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗