On uniform definability of types over finite sets-Reference-Cited by-同舟云学术

On uniform definability of types over finite sets

Published:2012-06 Issue:2 Volume:77 Page:499-514
ISSN:0022-4812
Container-title:The Journal of Symbolic Logic
language:en
Short-container-title:J. symb. log.

Author:

Guingona Vincent

Abstract

AbstractIn this paper, using definability of types over indiscernible sequences as a template, we study a property of formulas and theories called “uniform definability of types over finite sets” (UDTFS). We explore UDTFS and show how it relates to well-known properties in model theory. We recall that stable theories and weakly o-minimal theories have UDTFS and UDTFS implies dependence. We then show that all dp-minimal theories have UDTFS.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference7 articles.

1. Simon P. , On dp-minimal ordered structures, preprint, 09 2009.

2. Dolich A. , Goodrick J. , and Lippel D. , dp-Minimality: Basic facts and examples, preprint, 07 2009.

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A definable (p,q)-theorem for NIP theories;Advances in Mathematics;2024-01

2. On uniform definability of types over finite sets for NIP formulas;Journal of Mathematical Logic;2020-12-29

3. RAMSEY GROWTH IN SOME NIP STRUCTURES;Journal of the Institute of Mathematics of Jussieu;2019-02-19

4. Definability of types and VC density in differential topological fields;Archive for Mathematical Logic;2017-12-26

5. Vapnik-Chervonenkis density in some theories without the independence property, I;Transactions of the American Mathematical Society;2015-12-22