Journal of Symbolic Logic

Cardinal characteristics on graphs

Nick Haverkamp

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

A cardinal characteristic can often be described as the smallest size of a family of sequences which has a given property. Instead of this traditional concern for a smallest realization of the given property, a basically new approach, taken in [4] and [5], asks for a realization whose members are sequences of labels that correspond to 1-way infinite paths in a labelled graph. We study this approach as such, establishing tools that are applicable to all these cardinal characteristics. As an application, we demonstrate the power of the tools developed by presenting a short proof of the bounded graph conjecture [4].

Article information

Source
J. Symbolic Logic, Volume 76, Issue 1 (2011), 1-33.

Dates
First available in Project Euclid: 4 January 2011

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1294170987

Digital Object Identifier
doi:10.2178/jsl/1294170987

Mathematical Reviews number (MathSciNet)
MR2791335

Zentralblatt MATH identifier
1245.03069

Citation

Haverkamp, Nick. Cardinal characteristics on graphs. J. Symbolic Logic 76 (2011), no. 1, 1--33. doi:10.2178/jsl/1294170987. https://projecteuclid.org/euclid.jsl/1294170987


Export citation