Two hypergraph theorems equivalent to BPI
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.
scientific article; zbMATH DE number 4162871