Rado selection lemma and other combinatorial statements uniformly proved

Bulletin of the Section of Logic 34 (3):143-149 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Jónsson's lemma for regular and nilpotent shifts of pseudovarieties.E. Graczynska & I. Chajda - 1997 - Bulletin of the Section of Logic 26 (2).
Notes on the stable regularity lemma.M. Malliaris & S. Shelah - 2021 - Bulletin of Symbolic Logic 27 (4):415-425.
Lebesgue Convergence Theorems and Reverse Mathematics.Xiaokang Yu - 1994 - Mathematical Logic Quarterly 40 (1):1-13.
Canonical partition relations.James E. Baumgartner - 1975 - Journal of Symbolic Logic 40 (4):541-554.
The Craig, Robinson and Beth theorems for the modal logic of closure spaces.Jan Plaza - 1986 - Bulletin of the Section of Logic 15 (1):15-18.
Some new intuitionistic equivalents of Zorn’s Lemma.John L. Bell - 2003 - Archive for Mathematical Logic 42 (8):811-814.
Combinatorial Analytic Tableaux.Robert Cowen - 1993 - Reports on Mathematical Logic:29-39.
Finite high-order games and an inductive approach towards Gowers's dichotomy.Roy Wagner - 2001 - Annals of Pure and Applied Logic 111 (1-2):39-60.

Analytics

Added to PP
2013-10-30

Downloads
28 (#805,576)

6 months
3 (#1,480,774)

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

No references found.

Add more references