In

^{2} > âˆ£''S''âˆ£.
* VII-finite. ''S'' is I-finite or not well-orderable.
The forward implications (from strong to weak) are theorems within ZF. Counter-examples to the reverse implications (from weak to strong) in ZF with urelements are found using model theory. found counter-examples to each of the reverse implications in Mostowski models. LÃ©vy attributes most of the results to earlier papers by Mostowski and Lindenbaum.
Most of these finiteness definitions and their names are attributed to by . However, definitions I, II, III, IV and V were presented in , together with proofs (or references to proofs) for the forward implications. At that time, model theory was not sufficiently advanced to find the counter-examples.
Each of the properties I-finite thru IV-finite is a notion of smallness in the sense that any subset of a set with such a property will also have the property. This is not true for V-finite thru VII-finite because they may have countably infinite subsets.

mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It has no generally ...

(particularly set theory
illustrating the intersection of two sets
Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as ...

), a finite set is a set that has a finite
Finite is the opposite of Infinity, infinite. It may refer to:
* Finite number (disambiguation)
* Finite set, a set whose cardinality (number of elements) is some natural number
* Finite verb, a verb form that has a subject, usually being inflected ...

number of element
Element may refer to:
Science
* Chemical element
Image:Simple Periodic Table Chart-blocks.svg, 400px, Periodic table, The periodic table of the chemical elements
In chemistry, an element is a pure substance consisting only of atoms that all ...

s. Informally, a finite set is a set which one could in principle count and finish counting. For example,
:$\backslash $
is a finite set with five elements. The number of elements of a finite set is a natural number
File:Three Baskets.svg, Natural numbers can be used for counting (one apple, two apples, three apples, ...)
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and total order, o ...

(a non-negative
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

integer
An integer (from the Latin wikt:integer#Latin, ''integer'' meaning "whole") is colloquially defined as a number that can be written without a Fraction (mathematics), fractional component. For example, 21, 4, 0, and âˆ’2048 are integers, while 9 ...

) and is called the ''cardinality
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

'' of the set. A set that is not finite is called ''infinite''. For example, the set of all positive integers is infinite:
:$\backslash .$
Finite sets are particularly important in combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite set, finite Mathematical structure, structures. It is closely related to many other area ...

, the mathematical study of counting
Counting is the process of determining the number of Element (mathematics), elements of a finite set of objects. The traditional way of counting consists of continually increasing a (mental or spoken) counter by a unit for every element of the set, ...

. Many arguments involving finite sets rely on the pigeonhole principle
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

, which states that there cannot exist an injective function
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). I ...

from a larger finite set to a smaller finite set.
Definition and terminology

Formally, a set is called finite if there exists abijection
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

:$f\backslash colon\; S\backslash to\backslash $
for some natural number . The number is the set's cardinality, denoted as . The empty set#REDIRECT Empty set
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical an ...

or âˆ… is considered finite, with cardinality zero.
If a set is finite, its elements may be written â€” in many ways â€” in a sequence
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order theory, order matters. Like a Set (mathematics), set, it contains Element (mathematics), members (also called ''elements'', or ''terms''). ...

:
:$x\_1,x\_2,\backslash ldots,x\_n\; \backslash quad\; (x\_i\; \backslash in\; S,\; \backslash \; 1\; \backslash le\; i\; \backslash le\; n).$
In combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite set, finite Mathematical structure, structures. It is closely related to many other area ...

, a finite set with elements is sometimes called an ''-set'' and a subset with elements is called a ''-subset''. For example, the set is a 3-set â€“ a finite set with three elements â€“ and is a 2-subset of it.
(Those familiar with the definition of the natural numbers themselves as conventional in set theory, the so-called von Neumann construction, may prefer to use the existence of the bijection $f\; \backslash colon\; S\; \backslash to\; n$, which is equivalent.)
Basic properties

Any propersubset
In mathematics, Set (mathematics), set ''A'' is a subset of a set ''B'' if all Element (mathematics), elements of ''A'' are also elements of ''B''; ''B'' is then a superset of ''A''. It is possible for ''A'' and ''B'' to be equal; if they are u ...

of a finite set ''S'' is finite and has fewer elements than ''S'' itself. As a consequence, there cannot exist a bijection
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

between a finite set ''S'' and a proper subset of ''S''. Any set with this property is called Dedekind-finiteIn mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ha ...

. Using the standard ZFC axioms for set theory
illustrating the intersection of two sets
Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as ...

, every Dedekind-finite set is also finite, but this implication cannot be proved in ZF (Zermeloâ€“Fraenkel axioms without the axiom of choice
In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that ''a Cartesian product#Infinite Cartesian products, Cartesian product of a collection of non-empty sets is non-empty''. Informally put, the ax ...

) alone.
The axiom of countable choice
The axiom of countable choice or axiom of denumerable choice, denoted ACÏ‰, is an axiom
An axiom, postulate or assumption is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments. The ...

, a weak version of the axiom of choice, is sufficient to prove this equivalence.
Any injective function between two finite sets of the same cardinality is also a surjective function
In mathematics, a function (mathematics), function ''f'' from a set (mathematics), set ''X'' to a set ''Y'' is surjective (also known as onto, or a surjection), if for every Element (mathematics), element ''y'' in the codomain ''Y'' of ''f'', ther ...

(a surjection). Similarly, any surjection between two finite sets of the same cardinality is also an injection.
The union of two finite sets is finite, with
:$,\; S\backslash cup\; T,\; \backslash le\; ,\; S,\; +\; ,\; T,\; .$
In fact, by the inclusionâ€“exclusion principle
In combinatorics, a branch of mathematics, the inclusionâ€“exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union (set theory), union of two finite sets; symbolically expre ...

:
:$,\; S\backslash cup\; T,\; =\; ,\; S,\; +\; ,\; T,\; -\; ,\; S\backslash cap\; T,\; .$
More generally, the union of any finite number of finite sets is finite. The Cartesian product
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). I ...

of finite sets is also finite, with:
:$,\; S\backslash times\; T,\; =\; ,\; S,\; \backslash times,\; T,\; .$
Similarly, the Cartesian product of finitely many finite sets is finite. A finite set with ''n'' elements has 2 distinct subsets. That is, the
power set
Image:Hasse diagram of powerset of 3.svg, 250px, The elements of the power set of order theory, ordered with respect to Inclusion (set theory), inclusion.
In mathematics, the power set (or powerset) of a Set (mathematics), set is the set of al ...

of a finite set is finite, with cardinality 2.
Any subset of a finite set is finite. The set of values of a function when applied to elements of a finite set is finite.
All finite sets are countable
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

, but not all countable sets are finite. (Some authors, however, use "countable" to mean "countably infinite", so do not consider finite sets to be countable.)
The free semilatticeIn mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ha ...

over a finite set is the set of its non-empty subsets, with the being given by set union.
Necessary and sufficient conditions for finiteness

InZermeloâ€“Fraenkel set theory
In set theory
illustrating the intersection (set theory), intersection of two set (mathematics), sets.
Set theory is a branch of mathematical logic that studies Set (mathematics), sets, which informally are collections of objects. Although any t ...

without the axiom of choice (ZF), the following conditions are all equivalent:
# ''S'' is a finite set. That is, ''S'' can be placed into a one-to-one correspondence with the set of those natural numbers less than some specific natural number.
# (Kazimierz Kuratowski
Kazimierz Kuratowski (; 2 February 1896 â€“ 18 June 1980) was a Polish
Polish may refer to:
* Anything from or related to Poland
Poland ( pl, Polska ), officially the Republic of Poland ( pl, Rzeczpospolita Polska, links=no ), is a cou ...

) ''S'' has all properties which can be proved by mathematical induction beginning with the empty set and adding one new element at a time. (See below
Below may refer to:
*Earth
*Ground (disambiguation)
*Soil
*Floor
*Bottom (disambiguation)
*Less than
*Temperatures below freezing
*Hell or underworld
People with the surname
*Fred Below (1926â€“1988), American blues drummer
*Fritz von Below (1853â ...

for the set-theoretical formulation of Kuratowski finiteness.)
# ( Paul StÃ¤ckel) ''S'' can be given a total ordering which is well-order
In mathematics, a well-order (or well-ordering or well-order relation) on a Set (mathematics), set ''S'' is a total order on ''S'' with the property that every non-empty subset of ''S'' has a least element in this ordering. The set ''S'' together ...

ed both forwards and backwards. That is, every non-empty subset of ''S'' has both a least and a greatest element in the subset.
# Every one-to-one function from ''P''(''P''(''S'')) into itself is onto
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

. That is, the powerset
Image:Hasse diagram of powerset of 3.svg, 250px, The elements of the power set of order theory, ordered with respect to Inclusion (set theory), inclusion.
In mathematics, the power set (or powerset) of a Set (mathematics), set is the set of al ...

of the powerset of ''S'' is Dedekind-finite (see below).
# Every surjective function from ''P''(''P''(''S'')) onto itself is one-to-one.
# (Alfred Tarski
Alfred Tarski (; January 14, 1901 – October 26, 1983), born Alfred Teitelbaum,School of Mathematics and Statistics, University of St Andrews ''School of Mathematics and Statistics, University of St Andrews''. was a Polish-American logician a ...

) Every non-empty family of subsets of ''S'' has a minimal element
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It h ...

with respect to inclusion. (Equivalently, every non-empty family of subsets of ''S'' has a maximal element
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It h ...

with respect to inclusion.)
# ''S'' can be well-ordered and any two well-orderings on it are order isomorphicIn the mathematical field of order theory
Order theory is a branch of mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (g ...

. In other words, the well-orderings on ''S'' have exactly one order type
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

.
If the axiom of choice
In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that ''a Cartesian product#Infinite Cartesian products, Cartesian product of a collection of non-empty sets is non-empty''. Informally put, the ax ...

is also assumed (the axiom of countable choice
The axiom of countable choice or axiom of denumerable choice, denoted ACÏ‰, is an axiom
An axiom, postulate or assumption is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments. The ...

is sufficient), then the following conditions are all equivalent:
# ''S'' is a finite set.
# (Richard Dedekind
Julius Wilhelm Richard Dedekind (6 October 1831 â€“ 12 February 1916) was a German mathematician who made important contributions to abstract algebra (particularly ring theory
In algebra, ring theory is the study of ring (mathematics), rings ...

) Every one-to-one function from ''S'' into itself is onto.
# Every surjective function from ''S'' onto itself is one-to-one.
# ''S'' is empty or every partial order
Image:Hasse diagram of powerset of 3.svg, 250px, The Hasse diagram of the power set, set of all subsets of a three-element set , ordered by inclusion. Distinct sets on the same horizontal level are incomparable with each other. Some other pairs, su ...

ing of ''S'' contains a maximal element
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It h ...

.
Foundational issues

Georg Cantor
Georg Ferdinand Ludwig Philipp Cantor ( , ; â€“ January 6, 1918) was a German mathematician. He created set theory, which has become a fundamental theory in mathematics. Cantor established the importance of one-to-one correspondence be ...

initiated his theory of sets in order to provide a mathematical treatment of infinite sets. Thus the distinction between the finite and the infinite lies at the core of set theory. Certain foundationalists, the strict finitists, reject the existence of infinite sets and thus recommend a mathematics based solely on finite sets. Mainstream mathematicians consider strict finitism too confining, but acknowledge its relative consistency: the universe of hereditarily finite setIn mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ha ...

s constitutes a model of Zermeloâ€“Fraenkel set theory
In set theory
illustrating the intersection (set theory), intersection of two set (mathematics), sets.
Set theory is a branch of mathematical logic that studies Set (mathematics), sets, which informally are collections of objects. Although any t ...

with the axiom of infinity
In axiomatic set theory and the branches of mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, cha ...

replaced by its negation.
Even for those mathematicians who embrace infinite sets, in certain important contexts, the formal distinction between the finite and the infinite can remain a delicate matter. The difficulty stems from GÃ¶del's incompleteness theorems
GÃ¶del's incompleteness theorems are two theorems of mathematical logic
Mathematical logic, also called formal logic, is a subfield of mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (nu ...

. One can interpret the theory of hereditarily finite sets within Peano arithmetic
In mathematical logic, the Peano axioms, also known as the Dedekindâ€“Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th century Italian people, Italian mathematician Giuseppe Peano. These axioms have been ...

(and certainly also vice versa), so the incompleteness of the theory of Peano arithmetic implies that of the theory of hereditarily finite sets. In particular, there exists a plethora of so-called non-standard models of both theories. A seeming paradox is that there are non-standard models of the theory of hereditarily finite sets which contain infinite sets, but these infinite sets look finite from within the model. (This can happen when the model lacks the sets or functions necessary to witness the infinitude of these sets.) On account of the incompleteness theorems, no first-order predicate, nor even any recursive scheme of first-order predicates, can characterize the standard part of all such models. So, at least from the point of view of first-order logic, one can only hope to describe finiteness approximately.
More generally, informal notions like set, and particularly finite set, may receive interpretations across a range of formal system
A formal system is an abstract structure used for inferring theorems from axioms according to a set of rules. These rules, which are used for carrying out the inference of theorems from axioms, are the logical calculus of the formal system.
A form ...

s varying in their axiomatics and logical apparatus. The best known axiomatic set theories include Zermelo-Fraenkel set theory (ZF), Zermelo-Fraenkel set theory with the Axiom of Choice (ZFC), Von Neumannâ€“Bernaysâ€“GÃ¶del set theory
In the foundations of mathematics
Foundations of mathematics is the study of the philosophical and logical and/or algorithmic basis of mathematics, or, in a broader sense, the mathematical investigation of what underlies the philosophical theorie ...

(NBG), Non-well-founded set theoryNon-well-founded set theories are variants of axiomatic set theory
illustrating the intersection of two sets.
Set theory is a branch of mathematical logic
Mathematical logic, also called formal logic, is a subfield of mathematics
Mathema ...

, Bertrand Russell
Bertrand Arthur William Russell, 3rd Earl Russell (18 May 1872 â€“ 2 February 1970) was a British polymath
A polymath ( el, Ï€Î¿Î»Ï…Î¼Î±Î¸Î®Ï‚, ', "having learned much"; Latin
Latin (, or , ) is a classical language belonging to the It ...

's Type theory
In mathematics, logic, and computer science, a type theory is a formal system in which every "term" has a "type". A "type" in type theory has a role similar to a "type" in a programming language: it dictates the operations that can be performed on ...

and all the theories of their various models. One may also choose among classical first-order logic, various higher-order logics and intuitionistic logic
Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, systems of ...

.
A formalist might see the meaning of ''set'' varying from system to system. Some kinds of Platonist
Platonism is the philosophy
Philosophy (from , ) is the study of general and fundamental questions, such as those about reason, Metaphysics, existence, Epistemology, knowledge, Ethics, values, Philosophy of mind, mind, and Philosophy of ...

s might view particular formal systems as approximating an underlying reality.
Set-theoretic definitions of finiteness

In contexts where the notion ofnatural number
File:Three Baskets.svg, Natural numbers can be used for counting (one apple, two apples, three apples, ...)
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and total order, o ...

sits logically prior to any notion of set, one can define a set ''S'' as finite if ''S'' admits a bijection
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

to some set of natural numbers
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). ...

of the form $\backslash $. Mathematicians more typically choose to ground notions of number in set theory
illustrating the intersection of two sets
Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as ...

, for example they might model natural numbers by the order types of finite well-ordered
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It ...

sets. Such an approach requires a structural definition of finiteness that does not depend on natural numbers.
Various properties that single out the finite sets among all sets in the theory ZFC turn out logically inequivalent in weaker systems such as ZF or intuitionistic set theories. Two definitions feature prominently in the literature, one due to Richard Dedekind
Julius Wilhelm Richard Dedekind (6 October 1831 â€“ 12 February 1916) was a German mathematician who made important contributions to abstract algebra (particularly ring theory
In algebra, ring theory is the study of ring (mathematics), rings ...

, the other to Kazimierz Kuratowski
Kazimierz Kuratowski (; 2 February 1896 â€“ 18 June 1980) was a Polish
Polish may refer to:
* Anything from or related to Poland
Poland ( pl, Polska ), officially the Republic of Poland ( pl, Rzeczpospolita Polska, links=no ), is a cou ...

. (Kuratowski's is the definition used above.)
A set ''S'' is called Dedekind infinite if there exists an injective, non-surjective function $f:S\; \backslash rightarrow\; S$. Such a function exhibits a bijection between ''S'' and a proper subset of ''S'', namely the image of ''f''. Given a Dedekind infinite set ''S'', a function ''f'', and an element ''x'' that is not in the image of ''f'', we can form an infinite sequence of distinct elements of ''S'', namely $x,f(x),f(f(x)),...$. Conversely, given a sequence in ''S'' consisting of distinct elements $x\_1,\; x\_2,\; x\_3,\; ...$, we can define a function ''f'' such that on elements in the sequence $f(x\_i)\; =\; x\_$ and ''f'' behaves like the identity function otherwise. Thus Dedekind infinite sets contain subsets that correspond bijectively with the natural numbers. Dedekind finite naturally means that every injective self-map is also surjective.
Kuratowski finiteness is defined as follows. Given any set ''S'', the binary operation of union endows the powerset
Image:Hasse diagram of powerset of 3.svg, 250px, The elements of the power set of order theory, ordered with respect to Inclusion (set theory), inclusion.
In mathematics, the power set (or powerset) of a Set (mathematics), set is the set of al ...

''P''(''S'') with the structure of a semilattice. Writing ''K''(''S'') for the sub-semilattice generated by the empty set#REDIRECT Empty set
In mathematics
Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical an ...

and the singletons, call set ''S'' Kuratowski finite if ''S'' itself belongs to ''K''(''S''). Intuitively, ''K''(''S'') consists of the finite subsets of ''S''. Crucially, one does not need induction, recursion or a definition of natural numbers to define ''generated by'' since one may obtain ''K''(''S'') simply by taking the intersection of all sub-semilattices containing the empty set and the singleton (mathematics), singletons.
Readers unfamiliar with semilattices and other notions of abstract algebra may prefer an entirely elementary formulation. Kuratowski finite means ''S'' lies in the set ''K''(''S''), constructed as follows. Write ''M'' for the set of all subsets ''X'' of ''P''(''S'') such that:
* ''X'' contains the empty set;
* For every set ''T'' in ''P''(''S''), if ''X'' contains ''T'' then ''X'' also contains the union of ''T'' with any singleton.
Then ''K''(''S'') may be defined as the intersection of ''M''.
In ZF, Kuratowski finite implies Dedekind finite, but not vice versa. In the parlance of a popular pedagogical formulation, when the axiom of choice fails badly, one may have an infinite family of socks with no way to choose one sock from more than finitely many of the pairs. That would make the set of such socks Dedekind finite: there can be no infinite sequence of socks, because such a sequence would allow a choice of one sock for infinitely many pairs by choosing the first sock in the sequence. However, Kuratowski finiteness would fail for the same set of socks.
Other concepts of finiteness

In ZF set theory without the axiom of choice, the following concepts of finiteness for a set ''S'' are distinct. They are arranged in strictly decreasing order of strength, i.e. if a set ''S'' meets a criterion in the list then it meets all of the following criteria. In the absence of the axiom of choice the reverse implications are all unprovable, but if the axiom of choice is assumed then all of these concepts are equivalent. (Note that none of these definitions need the set of finite ordinal numbers to be defined first; they are all pure "set-theoretic" definitions in terms of the equality and membership relations, not involving Ï‰.) * I-finite. Every non-empty set of subsets of ''S'' has a âŠ†-maximal element. (This is equivalent to requiring the existence of a âŠ†-minimal element. It is also equivalent to the standard numerical concept of finiteness.) * Ia-finite. For every partition of ''S'' into two sets, at least one of the two sets is I-finite. * II-finite. Every non-empty âŠ†-monotone set of subsets of ''S'' has a âŠ†-maximal element. * III-finite. The power set ''P''(''S'') is Dedekind finite. * IV-finite. ''S'' is Dedekind finite. * V-finite. âˆ£''S''âˆ£ = 0 or 2â‹…âˆ£''S''âˆ£ > âˆ£''S'', . * VI-finite. âˆ£''S''âˆ£ = 0 or âˆ£''S''âˆ£ = 1 or âˆ£''S''âˆ£See also

*FinSet *Ordinal number *Peano arithmetic
In mathematical logic, the Peano axioms, also known as the Dedekindâ€“Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th century Italian people, Italian mathematician Giuseppe Peano. These axioms have been ...

Notes

References

* * * * * * * * * * * * * *External links

* {{Set theory Basic concepts in set theory Cardinal numbers