Skip to main content
SpringerLink
Log in

Consequence Operations Based on Hypergraph Satisfiability

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

Four consequence operators based on hypergraph satisfiability are defined. Their properties are explored and interconnections are displayed. Finally their relation to the case of the Classical Propositional Calculus is shown.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. COWEN, R. H., 1991, “Hypergraph satisfiability”, Reports on Mathematical Logic 24, 113-118.

    Google Scholar 

  2. COWEN, R. H., 1993, “Combinatorial Analytic Tableaux”, Reports on Mathematical Logic 27, 29-39.

    Google Scholar 

  3. KOLANY, A., 1993, “Satisfiability on hypergraphs”, Studia Logica 52, 393-404.

    Google Scholar 

  4. LINIAL, N., M. TARSI, 1985, “Deciding hypergraph 2-colorability by H-resolution”, Theoretical Computer Science 38, 343-347.

    Google Scholar 

Download references

Authors
  1. Adam Kolany
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kolany, A. Consequence Operations Based on Hypergraph Satisfiability. Studia Logica 58, 261–272 (1997). https://doi.org/10.1023/A:1004923723916

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1004923723916

Search

Navigation