On the cardinality of indifference classes | Zendy

Gerhard Herden | Zendy; Andreas Pallack | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the cardinality of indifference classes

Author(s) -

Gerhard Herden,

Andreas Pallack

Publication year - 2004

Publication title -

applied general topology

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.638

H-Index - 13

eISSN - 1989-4147

pISSN - 1576-9402

DOI - 10.4995/agt.2004.1967

Subject(s) - mathematics , cardinality (data modeling) , preorder , equivalence (formal languages) , space (punctuation) , discrete mathematics , topological space , combinatorics , computer science , data mining , operating system

Let “≤” be a continuous total preorder on some topological space (X, t). Then the cardinality or at least lower and upper bounds of the cardinality of the indifference (equivalence) classes of “≤ ” will be computed. In addition, the relevance of these bounds in mathematical utility theory and the theory of orderable topological spaces will be discussed

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research