Hostname: page-component-77f85d65b8-6bnxx Total loading time: 0 Render date: 2026-03-29T15:00:25.661Z Has data issue: false hasContentIssue false

BOOLEAN TYPES IN DEPENDENT THEORIES

Published online by Cambridge University Press:  26 January 2022

ITAY KAPLAN
Affiliation:
THE HEBREW UNIVERSITY OF JERUSALEM EINSTEIN INSTITUTE OF MATHEMATICS EDMOND J. SAFRA CAMPUS, GIVAT RAM JERUSALEM 91904, ISRAEL E-mail: kaplan@math.huji.ac.il URL: math.huji.ac.il/~kaplan
SAHARON SHELAH
Affiliation:
THE HEBREW UNIVERSITY OF JERUSALEM EINSTEIN INSTITUTE OF MATHEMATICS EDMOND J. SAFRA CAMPUS, GIVAT RAM JERUSALEM 91904, ISRAEL and DEPARTMENT OF MATHEMATICS, HILL CENTER-BUSCH CAMPUS, RUTGERS THE STATE UNIVERSITY OF NEW JERSEY 110 FRELINGHUYSEN ROAD PISCATAWAY, NJ 08854-8019, USA E-mail: shelah@math.huji.ac.il URL: shelah.logic.at
Rights & Permissions [Opens in a new window]

Abstract

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra $\mathcal {B}$ to each formula. We show some basic results regarding the effect of the properties of $\mathcal {B}$ on the behavior of such types, and show they are particularity well behaved in the case of NIP theories. In particular, we generalize the third author’s result about counting types, as well as the notion of a smooth type and extending a type to a smooth one. We then show that Keisler measures are tied to certain Boolean types and show that some of the results can thus be transferred to measures—in particular, giving an alternative proof of the fact that every measure in a dependent theory can be extended to a smooth one. We also study the stable case. We consider this paper as an invitation for more research into the topic of Boolean types.

Information

Type
Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Association for Symbolic Logic