Notre Dame Journal of Formal Logic 10 (2):214-224 (1969)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1305/ndjfl/1093893654
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 52,973
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Some Methods of Formal Proofs. III.Juliusz Reichbach - 1971 - Notre Dame Journal of Formal Logic 12 (4):479-482.
The Complexity of Propositional Proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
Satisfiability in a Larger Domain.R. L. Goodstein - 1974 - Notre Dame Journal of Formal Logic 15 (4):598-600.
.[author unknown] - unknown
Matrix Satisfiability and Axiomatization.Robert Ackermann - 1971 - Notre Dame Journal of Formal Logic 12 (3):309-321.

Analytics

Added to PP index
2010-08-24

Total views
4 ( #1,179,603 of 2,344,116 )

Recent downloads (6 months)
2 ( #332,321 of 2,344,116 )

How can I increase my downloads?

Downloads

My notes