Two hypergraph theorems equivalent to BPI (Q920087): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1305/ndjfl/1093635418 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006078799 / rank | |||
Normal rank | |||
Revision as of 22:27, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two hypergraph theorems equivalent to BPI |
scientific article |
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
