1980Proceedings of the Royal Society of London A Mathematical and Physical SciencesRequires access

Selective families of sets

Richard Rado

Open publisher page 1 citations

Abstract

Abstract Consider a cardinal number α, a set I and a family [Av:v in I) of sets. Suppose that for every subset N of I of cardinality less than α we are given a choice of an element x fNv A v for every v in N this paper the author investigates the circumstances under which it is then always possible to make a choice of an element x*of Avfor all v in which, in some precisely specified sense, can be approximated arbitrarily closely by some of the given partial choice functions x f . This question has turned out to be important when α is the least infinite cardinal number. Some of the results involve classes of ‘ large ’ cardinals.

About this research paper

What this paper is about

Abstract Consider a cardinal number α, a set I and a family [Av:v in I) of sets. Suppose that for every subset N of I of cardinality less than α we are given a choice of an element x fNv A v for every v in N this paper the author investigates the circumstances under which it is then always possible to make a choice of an element x*of Avfor all v in which, in some precisely specified sense, can be approximated arbitrarily closely by some of the given partial choice functions x f . This question has turned out to be important when α is the least infinite cardinal number. Some of the results involve classes of ‘ large ’ cardinals.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract Consider a cardinal number α, a set I and a family [Av:v in I) of sets. Suppose that for every subset N of I of cardinality less than α we are given a choice of an element x fNv A v for every v in N this paper the author investigates the circumstances under which it is then always possible to make a choice of an element x*of Avfor all v in which, in some precisely specified sense, can be approximated arbitrarily closely by some of the given partial choice functions x f . This question has turned out to be important when α is the least infinite cardinal number. Some of the results involve classes of ‘ large ’ cardinals.

Key concepts: Cardinality (data modeling), Element (criminal law), Cardinal number (linguistics), Mathematics, Combinatorics, Set (abstract data type), Family of sets, Maximal element

Related papers

Back to paper searchBrowse research topicsOriginal source
Selective families of sets — Research Paper | ScholarLens