VC-density for trees

Archive for Mathematical Logic 58 (5-6):587-603 (2019)
  Copy   BIBTEX

Abstract

We show that in the theory of infinite trees the VC-function is optimal. This generalizes a result of Simon showing that trees are dp-minimal.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

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-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.
On VC-Density in VC-Minimal Theories.Vincent Guingona - 2022 - Notre Dame Journal of Formal Logic 63 (3):395-413.
dp-Rank and Forbidden Configurations.Hunter Johnson - 2013 - Notre Dame Journal of Formal Logic 54 (1):1-13.
Antichains of perfect and splitting trees.Paul Hein & Otmar Spinas - 2020 - Archive for Mathematical Logic 59 (3-4):367-388.
Positive indiscernibles.Mark Kamsma - forthcoming - Archive for Mathematical Logic:1-20.
Partitions of trees and $${{\sf ACA}^\prime_{0}}$$.Bernard A. Anderson & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (3-4):227-230.

Analytics

Added to PP
2018-11-30

Downloads
13 (#1,065,706)

6 months
1 (#1,516,021)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On dp-minimal ordered structures.Pierre Simon - 2011 - Journal of Symbolic Logic 76 (2):448 - 460.
Théories d'arbres.Michel Parigot - 1982 - Journal of Symbolic Logic 47 (4):841-853.

Add more references