SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES

DOI10.1002/MALQ.19920380125MaRDI QIDQ4295241zbMATH OpenOpenAlexFDO

Authors Gregory Loren McColm

Publication date 1992

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19920380125

zbMATH Keywords

complexity classesexpressibility theoryfinite changesinfinite Ramsey theorempartitions

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other combinatorial set theory (03E05) Generalized Ramsey theory (05C55) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 4200143
• Recognition complexity of theories and their computational expressivity
• scientific article; zbMATH DE number 3948237
• On the n-back-and-forth types of Boolean algebras
• Complexity-theoretic algebra. II: Boolean algebras

Cited in

(7)

• On the combination of the Bernays-Schönfinkel-Ramsey fragment with simple linear integer arithmetic
• scientific article; zbMATH DE number 4200143 (Why is no real title available?)
• scientific article; zbMATH DE number 3948237 (Why is no real title available?)
• scientific article; zbMATH DE number 1850727 (Why is no real title available?)
• A packed Ramsey’s theorem and computability theory
• The canonical Ramsey theorem and computability theory
• When is arithmetic possible?

This page was built for publication: SOME RAMSEY THEORY IN BOOLEAN ALGEBRA FOR COMPLEXITY CLASSES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4295241)