Some Ramsey theory in Boolean algebra for complexity classes

Mathematical Logic Quarterly 38 (1):293-298 (1992)
  Copy   BIBTEX

Abstract

It is known that for two given countable sets of unary relations A and B on ω there exists an infinite set H ⫅ ω on which A and B are the same. This result can be used to generate counterexamples in expressibility theory. We examine the sharpness of this result

Categories

Keywords

Reprint years

DOI

10.1002/malq.19920380125

Other Versions

reprint McColm, Gregory L. (1992) "Some Ramsey theory in Boolean algebra for complexity classes". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38(1):293-298

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,607

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

A game‐theoretic proof of analytic Ramsey theorem.Kazuyuki Tanaka - 1992 - Mathematical Logic Quarterly 38 (1):301-304.
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
Making doughnuts of Cohen reals.Lorenz Halbeisen - 2003 - Mathematical Logic Quarterly 49 (2):173-178.
On the Boolean algebras of definable sets in weakly o‐minimal theories.Stefano Leonesi & Carlo Toffalori - 2004 - Mathematical Logic Quarterly 50 (3):241-248.
Combinatorial and recursive aspects of the automorphism group of the countable atomless Boolean algebra.E. W. Madison & B. Zimmermann-Huisgen - 1986 - Journal of Symbolic Logic 51 (2):292-301.
Matrices of completely Ramsey sets with infinitely many rows.Athanasios Tsarpalias - 2014 - Mathematical Logic Quarterly 60 (1-2):54-58.
Restriction respectueuse et reconstruction Des chaines et Des relations infinites.Jean Guillaume Hagendorf & J. G. Hagendorf - 1992 - Mathematical Logic Quarterly 38 (1):457-490.
Ramsey algebras and the existence of idempotent ultrafilters.Wen Chean Teh - 2016 - Archive for Mathematical Logic 55 (3-4):475-491.
Effective Versions of Ramsey's Theorem: Avoiding the Cone Above $\mathbf{0}$'.Tamara Lakins Hummel - 1994 - Journal of Symbolic Logic 59 (4):1301-1325.

Analytics

Added to PP
2013-12-01

Downloads
15 (#1,220,624)

6 months
5 (#1,015,253)

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