Premium
SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES
Author(s) -
McColm Gregory L.
Publication year - 1992
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19920380125
Subject(s) - unary operation , countable set , mathematics , counterexample , ramsey theory , boolean algebra , discrete mathematics , complete boolean algebra , stone's representation theorem for boolean algebras , two element boolean algebra , boolean algebras canonically defined , set (abstract data type) , infinite set , existential quantification , set theory , combinatorics , algebra over a field , pure mathematics , computer science , algebra representation , programming language
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.