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.
Preview
Unable to display preview. Download preview PDF.
References
Abian, A.: Generalized Completeness Theorem and Solvability of Systems of Boolean Equations. Zeitschr. für Math. Logik. 16 (1970), 263–264
Berge, C.: Hypergraphs. North Holland Mathematical Library. 45(1989)
Cowen, R.H.: Two hypergraph theorems equivalent to BPI. Notre Dame Journal of Formal Logic. 31 (1990), 232–240
Cowen, R.H.: Hypergraph satisfiability. Reports of Math. Logic. 25(1992), 113–117
Cowen, R.H.: Generalizing König's Infinity Lemma. Notre Dame Journal of Formal Logic. 38(1977), 243–247
Halmos, P.R., Vaughan, H.E.: The marriage problem. American Journal of Mathematics. 72(1949), 214–215
Howard, P. E.: Binary Consistent Choices on Pairs and a Generalization of Königs Infinity Lemma. Fund. Math. 121(1984), 17–19
Jech, T.: The Axiom of Choice. North Holland. (1973)
Levy, A.: Remarks on a paper by Mycielski. Acta Math. 14(1963), 125–130
Los, J., Ryll-Nardzewski, C.: On Application of Tychonoff's Theorem in Mathematical Proofs Fund. Math. 38(1951), 233–237
Rasiowa, H., Sikorski, R.: Mathematics of Metamathematics. Monografie Matematyczne PAN. 41 PWN, Warszawa 1963
Troelstra, A.S., van Dallen, D.: Constructivism in Mathematics. Studia in Logic and Foundations of Mathematics. 121 North Holland (1988)
Author information
Authors and Affiliations
Editor information
Rights 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