scientific article; zbMATH DE number 179052
Let \(G=(V,E)\) and \(H=(V,A)\) be two hypergraphs where the (possibly infinite) vertex set \(V\) is common and any member of \(A\) is a finite subset of \(V\). We say that \(H\) is satisfiable with respect to \(G\) if there exists a subset \(\sigma\) of \(V\) such that (1) \(e\subseteq \sigma\) is false for any \(e\) \((\in E)\), and (2) \(\alpha\cap \sigma\) is non-empty for any \(\alpha\) \((\in A)\). (This definition is interpreted in the following manner: the vertices are atomic sentences, \(E\) is a system of inconsistent conjunctions of sentences, \(A\) is a conjunctive normal form, it is required that \(A\) has value ``true. The sentences belonging to \(\sigma\) are considered to be ``true variables; by choosing \(\sigma\) one wants to select a consistent set of sentences and, in addition, to satisfy the formula assigned to \(A\).) In the first and second theorems of the paper, consequences are asserted supposing that any member of \(E\) is finite, or \(A\) is a finite collection, respectively. Further considerations concern the connection of the notion introduced above to the intuitionistic propositional calculus. The content is illustrated by a number of examples. The results are stated without proofs.
- Satisfiability on hypergraphs
- Consequence operations based on hypergraph satisfiability
- scientific article; zbMATH DE number 120352 (Why is no real title available?)
- scientific article; zbMATH DE number 517080 (Why is no real title available?)
- scientific article; zbMATH DE number 638367 (Why is no real title available?)
- scientific article; zbMATH DE number 1036758 (Why is no real title available?)
- Achieving new upper bounds for the hypergraph duality problem through logic
- Product of Graphs and Hybrid Logic
- scientific article; zbMATH DE number 6747949 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4039141)