Definitions of finiteness based on order properties

Omar De la Cruz, Damir D. Dzhafarov, and Eric J. Hall. "Definitions of finiteness based on order properties." Fundamenta Mathematicae 189.2 (2006): 155-172. <http://eudml.org/doc/282771>.

@article{OmarDelaCruz2006,
abstract = { A definition of finiteness is a set-theoretical property of a set that, if the Axiom of Choice (AC) is assumed, is equivalent to stating that the set is finite; several such definitions have been studied over the years. In this article we introduce a framework for generating definitions of finiteness in a systematical way: basic definitions are obtained from properties of certain classes of binary relations, and further definitions are obtained from the basic ones by closing them under subsets or under quotients. We work in set theory without AC to establish relations of implication and independence between these definitions, as well as between them and other notions of finiteness previously studied in the literature. It turns out that several well known definitions of finiteness (including Dedekind finiteness) fit into our framework by being equivalent to one of our definitions; however, a few of our definitions are actually new. We also show that Ia-finite unions of Ia-finite sets are P-finite (one of our new definitions), but that the class of P-finite sets is not provably closed under unions. },
author = {Omar De la Cruz, Damir D. Dzhafarov, Eric J. Hall},
journal = {Fundamenta Mathematicae},
keywords = {axiom of choice; finiteness; partial orders},
language = {eng},
number = {2},
pages = {155-172},
title = {Definitions of finiteness based on order properties},
url = {http://eudml.org/doc/282771},
volume = {189},
year = {2006},
}

TY - JOUR
AU - Omar De la Cruz
AU - Damir D. Dzhafarov
AU - Eric J. Hall
TI - Definitions of finiteness based on order properties
JO - Fundamenta Mathematicae
PY - 2006
VL - 189
IS - 2
SP - 155
EP - 172
AB - A definition of finiteness is a set-theoretical property of a set that, if the Axiom of Choice (AC) is assumed, is equivalent to stating that the set is finite; several such definitions have been studied over the years. In this article we introduce a framework for generating definitions of finiteness in a systematical way: basic definitions are obtained from properties of certain classes of binary relations, and further definitions are obtained from the basic ones by closing them under subsets or under quotients. We work in set theory without AC to establish relations of implication and independence between these definitions, as well as between them and other notions of finiteness previously studied in the literature. It turns out that several well known definitions of finiteness (including Dedekind finiteness) fit into our framework by being equivalent to one of our definitions; however, a few of our definitions are actually new. We also show that Ia-finite unions of Ia-finite sets are P-finite (one of our new definitions), but that the class of P-finite sets is not provably closed under unions.
LA - eng
KW - axiom of choice; finiteness; partial orders
UR - http://eudml.org/doc/282771
ER -