<?xml version="1.0" encoding="UTF-8"?>

<record version="11" id="4053">
 <title>classes of ordinals and enumerating functions</title>
 <name>ClassesOfOrdinalsAndEnumeratingFunctions</name>
 <created>2003-02-23 19:21:24</created>
 <modified>2006-10-28 00:45:56</modified>
 <type>Definition</type>
 <creator id="2727" name="mathcam"/>
 <author id="2760" name="yark"/>
 <author id="2727" name="mathcam"/>
 <author id="455" name="Henry"/>
 <classification>
	<category scheme="msc" code="03E10"/>
	<category scheme="msc" code="03F15"/>
 </classification>
 <defines>
	<concept>order type</concept>
	<concept>enumerating function</concept>
	<concept>closed</concept>
	<concept>kappa-closed</concept>
	<concept>continuous</concept>
	<concept>kappa-continuous</concept>
	<concept>continuous function</concept>
	<concept>kappa-continuous function</concept>
	<concept>closed class</concept>
	<concept>kappa-closed class</concept>
	<concept>normal function</concept>
	<concept>kappa-normal function</concept>
	<concept>normal</concept>
	<concept>kappa-normal</concept>
	<concept>unbounded</concept>
	<concept>unbounded class</concept>
	<concept>kappa-unbounded</concept>
	<concept>kappa-unbounded class</concept>
	<concept>class of ordinals</concept>
 </defines>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

\def\dom{\operatorname{dom}}</preamble>
 <content>\PMlinkescapeword{class}
\PMlinkescapeword{order}

A \emph{class of ordinals} is just a subclass of the \PMlinkname{class}{Class} $\mathbf{On}$ of all ordinals. For every class of ordinals $M$ there is an \emph{enumerating function} $f_M$ defined by transfinite recursion:
$$f_M(\alpha)=\min\{x\in M\mid f(\beta)&lt;x\text{ for all }\beta&lt;\alpha\},$$
and we define the \emph{order type} of $M$ by $\operatorname{otype}(M)=\dom(f)$.  The possible values for this value are either $\mathbf{On}$ or some ordinal $\alpha$. The above function simply lists the elements of $M$ in order. Note that it is not necessarily defined for all ordinals, although it is defined for a segment of the ordinals. If $\alpha&lt;\beta$ then $f_M(\alpha)&lt;f_M(\beta)$, so $f_M$ is an order isomorphism between $\operatorname{otype}(M)$ and $M$.

For an ordinal $\kappa$, we say $M$ is $\kappa$-\emph{closed} if for any $N\subseteq M$ such that $|N|&lt;\kappa$, also $\sup N\in M$.

We say $M$ is \emph{$\kappa$-unbounded} if for any $\alpha&lt;\kappa$ there is some $\beta\in M$ such that $\alpha&lt;\beta$.

We say a function $f\colon M\rightarrow\mathbf{On}$ is $\kappa$-\emph{continuous} if $M$ is $\kappa$-closed and
$$f(\sup N)=\sup \{f(\alpha)\mid \alpha\in N\}$$

A function is \emph{$\kappa$-normal} if it is order preserving ($\alpha&lt;\beta$ implies $f(\alpha)&lt;f(\beta)$) and continuous. In particular, the enumerating function of a $\kappa$-closed class is always $\kappa$-normal.

All these definitions can be easily extended to all ordinals: a class is \emph{closed} (resp. \emph{unbounded}) if it is $\kappa$-closed (unbounded) for all $\kappa$. A function is \emph{continuous} (resp. \emph{normal}) if it is $\kappa$-continuous (normal) for all $\kappa$.</content>
</record>
