No label defined (Q4039141)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 179052
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 179052

      Statements

      0 references
      5 May 1994
      0 references
      logical satisfiability
      0 references
      hypergraphs
      0 references
      intuitionistic propositional calculus
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references