Two Hypergrαph Theorems Equivalent toBPI

Notre Dame Journal of Formal Logic 31 (2):232-240 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 76,140

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Two hypergraph theorems equivalent to ${\rm BPI}$.Robert H. Cowen - 1990 - Notre Dame Journal of Formal Logic 31 (2):232-240.
Reverse Mathematics and Completeness Theorems for Intuitionistic Logic.Takeshi Yamazaki - 2001 - Notre Dame Journal of Formal Logic 42 (3):143-148.
Deduction theorems for weak implicational logics.M. W. Bunder - 1982 - Studia Logica 41 (2-3):95 - 108.
On some Theorems Equivalent with the Axiom of Choice.Bernhard Banaschewski - 1961 - Mathematical Logic Quarterly 7 (17‐18):279-282.
Four relevant Gentzen systems.Steve Giambrone & Aleksandar Kron - 1987 - Studia Logica 46 (1):55 - 71.
Indirect-deduction theorems.S. J. Surma - 1967 - Studia Logica 20 (1):164-166.
Separation and weak könig's lemma.A. James Humphreys & Stephen G. Simpson - 1999 - Journal of Symbolic Logic 64 (1):268-278.
The 3-Stratifiable Theorems of.Marcel Crabbé - 1999 - Notre Dame Journal of Formal Logic 40 (2):174-182.

Analytics

Added to PP
2014-04-07

Downloads
7 (#1,044,144)

6 months
1 (#447,993)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Satisfiability on hypergraphs.Adam Kolany - 1993 - Studia Logica 52 (3):393-404.
2-CNFS and Logical Embeddings.Robert Cowen - 2009 - Studia Logica 93 (1):15-19.

Add more citations

References found in this work

No references found.

Add more references