INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

Clicks: 60
ID: 294910
1961
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Popular

Ranked #3 of 9 articles by views in The Quarterly Journal of Mathematics

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
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

No comments yet. Be the first to comment on this article.