Skip to main content
SpringerLink
Log in
Book cover

Kurt Gödel Colloquium on Computational Logic and Proof Theory

KGC 1993: Computational Logic and Proof Theory pp 231–242Cite as

On the logic of hypergraphs

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 713))

Abstract

A notion of satisfiability on hypergraphs is introduced and some existence problems are shown to be instances of the satisfiability on appropriate hypergraphs. Then a hypergraph based interpretation of propositional connectives is defined. This interpretation unexpectably turns out to be adequate for the Intuitionistic Propositional Calculus.

At the end some possible directions of research in this field are suggested.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abian, A.: Generalized Completeness Theorem and Solvability of Systems of Boolean Equations. Zeitschr. für Math. Logik. 16 (1970), 263–264

    Google Scholar 

  2. Berge, C.: Hypergraphs. North Holland Mathematical Library. 45(1989)

    Google Scholar 

  3. Cowen, R.H.: Two hypergraph theorems equivalent to BPI. Notre Dame Journal of Formal Logic. 31 (1990), 232–240

    Google Scholar 

  4. Cowen, R.H.: Hypergraph satisfiability. Reports of Math. Logic. 25(1992), 113–117

    Google Scholar 

  5. Cowen, R.H.: Generalizing König's Infinity Lemma. Notre Dame Journal of Formal Logic. 38(1977), 243–247

    Google Scholar 

  6. Halmos, P.R., Vaughan, H.E.: The marriage problem. American Journal of Mathematics. 72(1949), 214–215

    Google Scholar 

  7. Howard, P. E.: Binary Consistent Choices on Pairs and a Generalization of Königs Infinity Lemma. Fund. Math. 121(1984), 17–19

    Google Scholar 

  8. Jech, T.: The Axiom of Choice. North Holland. (1973)

    Google Scholar 

  9. Levy, A.: Remarks on a paper by Mycielski. Acta Math. 14(1963), 125–130

    Google Scholar 

  10. Los, J., Ryll-Nardzewski, C.: On Application of Tychonoff's Theorem in Mathematical Proofs Fund. Math. 38(1951), 233–237

    Google Scholar 

  11. Rasiowa, H., Sikorski, R.: Mathematics of Metamathematics. Monografie Matematyczne PAN. 41 PWN, Warszawa 1963

    Google Scholar 

  12. Troelstra, A.S., van Dallen, D.: Constructivism in Mathematics. Studia in Logic and Foundations of Mathematics. 121 North Holland (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Silesian University, Bankowa 14, Katowice, Poland

    A. Kolany

Authors
  1. A. Kolany
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Georg Gottlob Alexander Leitsch Daniele Mundici

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kolany, A. (1993). On the logic of hypergraphs. In: Gottlob, G., Leitsch, A., Mundici, D. (eds) Computational Logic and Proof Theory. KGC 1993. Lecture Notes in Computer Science, vol 713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022572

Download citation

  • DOI: https://doi.org/10.1007/BFb0022572

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57184-1

  • Online ISBN: 978-3-540-47943-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation