INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Clicks: 24
ID: 294910
1961
Article Quality & Performance Metrics
Overall Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
0.0
/100
0 views
0 readers
AI Quality Assessment
Not analyzed
Abstract
2. Notation The letters a, b, c, d, x, y, z denote finite sets of non-negative integers, all other lower-case letters denote non-negative integers. If fc I, then [k, I) denotes the set {k,k+l,k+2,...,l-l} = {*: fc < « < Q. The obliteration operator serves to remove from any system of elements the element above which it is placed. Thus [k,I) = {k,k-{-l,...,fy. The cardinal of o is \a inclusion (in the wide sense), union, difference, and intersection of sets are denoted by o c b, a-\-b, a—b, ab respectively, and a—b = a—ab for all a, b. By 8(k,l,m) we denote the set of all systems (ao,av...,dn) such that avc[0,m); \av 1 (v < »),
| Reference Key |
openalex_W2019935404
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Péter L. Erdős, Chao Ko, R. Rado |
| Journal | The Quarterly Journal of Mathematics |
| Year | 1961 |
| DOI |
10.1093/qmath/12.1.313
|
| URL | |
| Keywords | Keywords not found |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.