dp-Rank and Forbidden Configurations

Notre Dame Journal of Formal Logic 54 (1):1-13 (2013)
  Copy   BIBTEX

Abstract

A theory $T$ is shown to have an ICT pattern of depth $k$ in $n$ variables iff it interprets some $k$ -maximum VC class in $n$ parameters

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On VC-Density in VC-Minimal Theories.Vincent Guingona - 2022 - Notre Dame Journal of Formal Logic 63 (3):395-413.
VC-density for trees.Anton Bobkov - 2019 - Archive for Mathematical Logic 58 (5-6):587-603.
On VC-minimal theories and variants.Vincent Guingona & Michael C. Laskowski - 2013 - Archive for Mathematical Logic 52 (7-8):743-758.
On VC-minimal fields and dp-smallness.Vincent Guingona - 2014 - Archive for Mathematical Logic 53 (5-6):503-517.
Witnessing Dp-Rank.Itay Kaplan & Pierre Simon - 2014 - Notre Dame Journal of Formal Logic 55 (3):419-429.
Dp-finite fields I(A): The infinitesimals.Will Johnson - 2021 - Annals of Pure and Applied Logic 172 (6):102947.

Analytics

Added to PP
2012-12-15

Downloads
26 (#856,815)

6 months
11 (#354,748)

Historical graph of downloads
How can I increase my downloads?