Satisfiability on hypergraphs
type: Item
instance of: scholarly article
title: Satisfiability on hypergraphs
zbMATH Open document ID: 0790.03010
DOI: 10.1007/BF01057654
author: Adam Kolany
published in: Studia Logica
publication date: 1994-06-22T00:00:00Z
Mathematics Subject Classification ID: 03B35
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 488344
zbMATH Keywords: Prime Ideal Theorem
zbMATH Keywords: generalization of the resolution rule for hypergraphs
zbMATH Keywords: compactness property
zbMATH Keywords: hypergraph satisfiability
zbMATH Keywords: Boolean algebra
zbMATH Keywords: ultrafilter
MaRDI profile type: Publication
cites work: Generalized Completeness Theorem and Solvability of Systems of Boolean Polynomial Equations
cites work: Two hypergraph theorems equivalent to BPI
cites work: Q4025013
cites work: The Marriage Problem
full work available at URL: https://doi.org/10.1007/bf01057654
OpenAlex ID: W2068178000
description: scientific article; zbMATH DE number 488344