Two hypergraph theorems equivalent to ${\rm BPI}$.

Abstract

Techniques originally developed for establishing NP-Completeness are adapted to prove that two compactness theorems concerning hypergraphs are equivalent to the Prime Ideal Theorem for Boolean algebras (BPI). In addition, some possible connections between NP-Completeness and BPI are explored.