Back to Search Start Over

SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES.

Authors :
McColm, Gregory L.
Source :
Mathematical Logic Quarterly. 1992, Vol. 38 Issue 1, p293-298. 6p.
Publication Year :
1992

Abstract

The article presents a study which examines the sharpness of theorem 0.2. to prove the Infinite Ramsey theorem. It mentions that the analysis of unary's relations will result to the generation of counterexamples in expressibility theory. It presents the formula which explores the situation on all countable and closed under besideness and Boolean operations.

Details

Language :
English
ISSN :
09425616
Volume :
38
Issue :
1
Database :
Academic Search Index
Journal :
Mathematical Logic Quarterly
Publication Type :
Academic Journal
Accession number :
62674833
Full Text :
https://doi.org/10.1002/malq.19920380125