Cardinal assignment

In set theory, the concept of cardinality is significantly developable without recourse to actually defining cardinal numbers as objects in the theory itself (this is in fact a viewpoint taken by Frege; Frege cardinals are basically equivalence classes on the entire universe of sets, by equinumerosity). The concepts are developed by defining equinumerosity in terms of functions and the concepts of one-to-one and onto (injectivity and surjectivity); this gives us a quasi-ordering relation

A≤cB⟺(∃f)(f:A->B is injective)

on the whole universe by size. It is not a true partial ordering because antisymmetry need not hold: if both A≤cB and B≤cA, it is true by the Cantor–Bernstein–Schroeder theorem that A=cB i.e. A and B are equinumerous, but they do not have to be literally equal (see isomorphism). That at least one of A≤cB and B≤cA holds turns out to be equivalent to the axiom of choice.

Nevertheless, most of the interesting results on cardinality and its arithmetic can be expressed merely with =c.

The goal of a cardinal assignment is to assign to every set A a specific, unique set that is only dependent on the cardinality of A. This is in accordance with Cantor's original vision of cardinals: to take a set and abstract its elements into canonical "units" and collect these units into another set, such that the only thing special about this set is its size. These would be totally ordered by the relation ≤c, and =c would be true equality. As Y. N. Moschovakis says, however, this is mostly an exercise in mathematical elegance, and you don't gain much unless you are "allergic to subscripts." However, there are various valuable applications of "real" cardinal numbers in various models of set theory.

In modern set theory, we usually use the Von Neumann cardinal assignment, which uses the theory of ordinal numbers and the full power of the axioms of choice and replacement. Cardinal assignments do need the full axiom of choice, if we want a decent cardinal arithmetic and an assignment for all sets.

## Cardinal assignment without the axiom of choice

Formally, assuming the axiom of choice, the cardinality of a set X is the least ordinal α such that there is a bijection between X and α. This definition is known as the von Neumann cardinal assignment. If the axiom of choice is not assumed we need to do something different. The oldest definition of the cardinality of a set X (implicit in Cantor and explicit in Frege and Principia Mathematica) is as the set of all sets that are equinumerous with X: this does not work in ZFC or other related systems of axiomatic set theory because this collection is too large to be a set, but it does work in type theory and in New Foundations and related systems. However, if we restrict from this class to those equinumerous with X that have the least rank, then it will work (this is a trick due to Dana Scott: it works because the collection of objects with any given rank is a set; see Scott's trick).

## References

* Moschovakis, Yiannis N. Notes on Set Theory. New York: Springer-Verlag, 1994.

* v
* t
* e

Mathematical logic

General|

* Formal language
* Formation rule
* Formal proof
* Formal semantics
* Well-formed formula
* Set
* Element
* Class
* Classical logic
* Axiom
* Rule of inference
* Relation
* Theorem
* Logical consequence
* Type theory
* Symbol
* Syntax
* Theory

Systems|

* Formal system
* Deductive system
* Axiomatic system
* Hilbert style systems
* Natural deduction
* Sequent calculus

Traditional logic|

* Proposition
* Inference
* Argument
* Validity
* Cogency
* Syllogism
* Square of opposition
* Venn diagram

Propositional calculus
and Boolean logic

* Boolean functions
* Propositional calculus
* Propositional formula
* Logical connectives
* Truth tables
* Many-valued logic

Predicate logic|

* First-order
* Quantifiers
* Predicate
* Second-order
* Monadic predicate calculus

Naive set theory|

* Set
* Empty set
* Element
* Enumeration
* Extensionality
* Finite set
* Infinite set
* Subset
* Power set
* Countable set
* Uncountable set
* Recursive set
* Domain
* Codomain
* Image
* Map
* Function
* Relation
* Ordered pair

Set theory|

* Foundations of mathematics
* Zermelo–Fraenkel set theory
* Axiom of choice
* General set theory
* Kripke–Platek set theory
* Von Neumann–Bernays–Gödel set theory
* Morse–Kelley set theory
* Tarski–Grothendieck set theory

Model theory|

* Model
* Interpretation
* Non-standard model
* Finite model theory
* Truth value
* Validity

Proof theory|

* Formal proof
* Deductive system
* Formal system
* Theorem
* Logical consequence
* Rule of inference
* Syntax

Computability
theory|

* Recursion
* Recursive set
* Recursively enumerable set
* Decision problem
* Church–Turing thesis
* Computable function
* Primitive recursive function

0.00

(0 votes)

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Cardinal_assignment&oldid=4266441"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template