A stronger theorem concerning the non-existence of combinatorial designs on infinite sets

Notre Dame Journal of Formal Logic 14 (4):554-558 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

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

Combinatorial designs on infinite sets.William J. Frascella - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):27-47.
A stronger form of a theorem of Friedberg.Kempachiro Ohashi - 1964 - Notre Dame Journal of Formal Logic 5 (1):10-12.
A stronger definition of a recursively infinite set.Charles H. Applebaum - 1973 - Notre Dame Journal of Formal Logic 14 (3):411-412.
A theorem on maximal sets.Joseph S. Ullian - 1961 - Notre Dame Journal of Formal Logic 2 (4):222-223.
Infinite sets of nonequivalent modalities.Fabio Bellissima - 1989 - Notre Dame Journal of Formal Logic 30 (4):574-582.
An early fifteenth century discussion of infinite sets.E. J. Ashworth - 1977 - Notre Dame Journal of Formal Logic 18 (2):232-234.

Analytics

Added to PP
2010-08-24

Downloads
17 (#865,345)

6 months
3 (#1,207,210)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

William Frascella
Indiana University South Bend

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references