- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Certain counterexamples to the construction of combinatorial designs on infinite sets
Notre Dame Journal of Formal Logic 12 (4):461-466 (1971)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
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
Combinatorial designs on infinite sets.William J. Frascella - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):27-47.
A stronger theorem concerning the non-existence of combinatorial designs on infinite sets.William J. Frascella - 1973 - Notre Dame Journal of Formal Logic 14 (4):554-558.
The non-existence of a certain combinatorial design on an infinite set.William J. Frascella - 1969 - Notre Dame Journal of Formal Logic 10 (3):317-323.
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.
On differences of certain structured sets.Albert A. Mullin - 1963 - Notre Dame Journal of Formal Logic 4 (2):158-160.
A certain conception of the calculus of rough sets.Zbigniew Bonikowski - 1992 - Notre Dame Journal of Formal Logic 33 (3):412-421.
A generalization of combinatorial operators.Anna Silverstein - 1978 - Notre Dame Journal of Formal Logic 19 (4):639-645.
Combinatorial systems with axiom.C. E. Hughes & W. E. Singletary - 1973 - Notre Dame Journal of Formal Logic 14 (3):354-360.
Analytics
Added to PP
2010-08-24
Downloads
21 (#997,151)
6 months
6 (#838,367)
2010-08-24
Downloads
21 (#997,151)
6 months
6 (#838,367)
Historical graph of downloads
Author's Profile
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-2pm92 dc2