Selective families of sets
Richard Rado
Abstract
Richard Rado
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.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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