Two hypergraph theorems equivalent to BPI
From MaRDI portal
Publication:920087
DOI10.1305/ndjfl/1093635418zbMath0708.03024OpenAlexW2006078799WikidataQ60680295 ScholiaQ60680295MaRDI QIDQ920087
Publication date: 1990
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1093635418
Hypergraphs (05C65) Complexity of computation (including implicit computational complexity) (03D15) Other classical set theory (including functions, relations, and set algebra) (03E20)
Related Items
Borsuk's partition problem and finite point sets, 2-cnfs and logical embeddings, Satisfiability on hypergraphs
