Two hypergraph theorems equivalent to ${\rm BPI}$
Notre Dame Journal of Formal Logic 31 (2):232-240 (1990)
Abstract
This article has no associated abstract. (fix it)DOI
10.1305/ndjfl/1093635418
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Preservation theorems without continuum hypothesis.George C. Nelson - 1998 - Studia Logica 60 (3):343-355.
Deduction theorems for weak implicational logics.M. W. Bunder - 1982 - Studia Logica 41 (2-3):95 - 108.
Four relevant Gentzen systems.Steve Giambrone & Aleksandar Kron - 1987 - Studia Logica 46 (1):55 - 71.
Connections between axioms of set theory and basic theorems of universal algebra.H. Andréka, Á Kurucz & I. Németi - 1994 - Journal of Symbolic Logic 59 (3):912-923.
On defining necessity in terms of entailment.Dennis Henry & Michael Byrd - 1979 - Studia Logica 38 (2):95 - 104.
Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic.Peter Clote & Kenneth Mcaloon - 1983 - Journal of Symbolic Logic 48 (4):1090-1104.
Finite conformal hypergraph covers and Gaifman cliques in finite structures.Ian Hodkinson & Martin Otto - 2003 - Bulletin of Symbolic Logic 9 (3):387-405.
Consistency, Turing Computability and Gödel’s First Incompleteness Theorem.Robert F. Hadley - 2008 - Minds and Machines 18 (1):1-15.
Hypergraph sequences as a tool for saturation of ultrapowers.M. E. Malliaris - 2012 - Journal of Symbolic Logic 77 (1):195-223.
Separation and weak könig's lemma.A. James Humphreys & Stephen G. Simpson - 1999 - Journal of Symbolic Logic 64 (1):268-278.
Analytics
Added to PP
2010-08-24
Downloads
7 (#1,044,144)
6 months
1 (#447,993)
2010-08-24
Downloads
7 (#1,044,144)
6 months
1 (#447,993)
Historical graph of downloads
