Two hypergraph theorems equivalent to BPI (Q920087)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4162871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two hypergraph theorems equivalent to BPI |
scientific article; zbMATH DE number 4162871 |
Statements
Two hypergraph theorems equivalent to BPI (English)
0 references
1990
0 references
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.
0 references
NP-completeness
0 references
compactness
0 references
hypergraphs
0 references
Prime Ideal Theorem
0 references
Boolean algebras
0 references
0.8334458470344543
0 references
0.7652900815010071
0 references
