Satisfiability on hypergraphs

DOI10.1007/BF01057654zbMath0790.03010OpenAlexW2068178000MaRDI QIDQ1313082

Adam Kolany

Publication date: 22 June 1994

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01057654

zbMATH Keywords

Boolean algebraultrafilterPrime Ideal Theoremcompactness propertygeneralization of the resolution rule for hypergraphshypergraph satisfiability

Mathematics Subject Classification ID

Hypergraphs (05C65) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Related Items (2)

Bipartite bihypergraphs: a survey and new results ⋮ Reversed resolution in reducing general satisfiability problem

Cites Work

• Unnamed Item
• Two hypergraph theorems equivalent to BPI
• Generalized Completeness Theorem and Solvability of Systems of Boolean Polynomial Equations
• The Marriage Problem

This page was built for publication: Satisfiability on hypergraphs