Index des notations

$\Box, \tau, \nu, \neg, \Rightarrow$: I, p. 14--15 $\tau_x(A), (B | x)A, A\{x\}, A\{x, y\}, A\{B\}, A\{B, C\}$: I, p. 16 $\text{non}(A), (A) \text{ ou } (B), (A) \Rightarrow (B)$: I, p. 21 $A$ et $B$ : I, p. 29 $\Leftrightarrow, A \Leftrightarrow B$: I, p. 30 $(\exists x)R, (\forall x)R$: I, p. 32 $(\exists_{Ax})R, (\forall_{Ax})R$: I, p. 35 $=, \neq, T = U, T \neq U$: I, p. 38--39 $\in, \notin, T \in U, T \notin U$: II, p. 1 $\subset, \supset, \notin, \not\subset, x \subset y, x \supset y$: II, p. 2 $\text{Coll}_x R, \{x \mid R\}$: II, p. 4 $\{x, y\}, \{x\}$: II, p. 4 $\{x \in A \mid P\}$: II, p. 5 $\complement_X A, X - A, \complement A, \varnothing$: II, p. 6 $(x, y), \operatorname{pr}_1 z, \operatorname{pr}_2 z$: II, p. 7 $A \times B, A \times B \times C, A \times B \times C \times D, (x, y, z)$: II, p. 8--9 $\operatorname{pr}_1\langle G \rangle, \operatorname{pr}_2\langle G \rangle, \operatorname{pr}_1 G, \operatorname{pr}_2 G\ (\text{G graphe})$: II, p. 9 $G\langle X \rangle, G(X), G(x)\ (\text{G graphe, X ensemble, x objet})$: II, p. 10 $\Gamma\langle X \rangle, \Gamma(X), \Gamma(x)\ (\text{$\Gamma$ correspondance, X ensemble, x objet})$: II, p. 10--11 $\overline{G}^{-1}\ (\text{G graphe}), \overline{\Gamma}^{-1}\ (\text{$\Gamma$ correspondance})$: II, p. 11 $G' \circ G, G'G\ (\text{G, G' graphes}), \Gamma' \circ \Gamma, \Gamma'\Gamma\ (\text{$\Gamma$, $\Gamma'$ correspondances})$: II, p. 12--13 $\Delta_A, \operatorname{Id}_A\ (\text{A ensemble})$: II, p. 13 $f(x), f_x\ (\text{f fonction}), F(x), F_x\ (\text{F graphe fonctionnel})$: II, p. 13 $f : A \to B, A \xrightarrow{f} B$: II, p. 14 $x \mapsto T\ (x \in A, T \in C), x \mapsto T\ (x \in A), x \mapsto T,\ (T_x)_{x \in A}, T\ (\text{par abus de langage})\ (\text{$T$ terme})$: II, p. 16 $\operatorname{pr}_1, \operatorname{pr}_2$: II, p. 16 $gf\ (g, f$ applications) (par abus de langage) : II, p. 16 $f(x, y), f(., y), f(x, .), f( , y), f(x, )$: II, p. 21 $u \times v\ (u, v$ fonctions), $(u, v)$ (par abus de langage) : II, p. 21 $\bigcup_{i \in I} X_i, \bigcap_{i \in I} X_i$: II, p. 22 $\bigcup_{X \in \mathfrak{X}} X, \bigcap_{X \in \mathfrak{X}} X$: II, p. 24 $A \cup B, A \cup B \cup C, A \cap B, A \cap B \cap C$: II, p. 26 $\{x, y, z\}$: II, p. 26 $\mathfrak{B}(X)$: II, p. 30 $\mathscr{F}(E; F), F^E$: II, p. 31

$\prod_{i \in I} X_i, \operatorname{pr}_i$: II, p. 32 $\operatorname{pr}_J$: II, p. 33 $(g_i)_{i \in I} \text{ (extension aux produits de la famille } (g_i)_{i \in I}, \text{ par abus de langage)}$: II, p. 38 $x \equiv y \pmod{R} \text{ (R relation d'équivalence)}$: II, p. 40 $E/R \text{ (E ensemble, R relation d'équivalence)}$: II, p. 41 $R_A \text{ (R relation d'équivalence, A ensemble)}$: II, p. 45 $R/S \text{ (R, S relations d'équivalence)}$: II, p. 46 $R \times R' \text{ (R, R' relations d'équivalence)}$: II, p. 46 $x \leq y, y \geq x, x \not\leq y$: III, p. 4 $x < y, y > x$: III, p. 5 $\sup_E X, \inf_E X$: III, p. 10 $\sup X, \inf X$: III, p. 10 $\sup(x, y), \inf(x, y)$: III, p. 10 $\sup_{x \in A} f(x), \inf_{x \in A} f(x)$: III, p. 10 $\sup_{x \in A} x, \inf_{x \in A} x$: III, p. 10 $[a, b], [a, b[, ]a, b], ]a, b[$: III, p. 14 $]\leftarrow, a], ]\leftarrow, a[, [a, \rightarrow[, ]a, \rightarrow[, ]\leftarrow, \rightarrow[$: III, p. 15 $S_x$: III, p. 16 $Eq(X, Y), Card(X)$: III, p. 23 $0, 1, 2$: III, p. 23–24 $\varepsilon \leq \eta \text{ ($\varepsilon$, $\eta$ cardinaux)}$: III, p. 25 $\sup_{i \in I} ((a_i)_{i \in I} \text{ famille de cardinaux})$: III, p. 25 $\sum_{i \in I} a_i, \bigwedge_{i \in I} a_i, \prod_{i \in I} a_i ((a_i)_{i \in I} \text{ famille de cardinaux})$: III, p. 25–26 $a + b, ab \text{ (a, b cardinaux)}$: III, p. 26 $a^b \text{ (a, b cardinaux)}$: III, p. 28 $3, 4$: III, p. 31 $a - b \text{ (a, b entiers, } b < a)$: III, p. 37 $(t_i)_{P \leq i \leq b}, (t_i)_{a \leq i \leq b}$: III, p. 38 $\prod_{P \leq i} X_i, \prod_{i = a}^b X_i$: III, p. 38 $\varphi_A \text{ (A partie d'un ensemble E)}$: III, p. 38 $\frac{a}{b}, a/b \text{ (a, b entiers tels que } b \text{ divise } a)$: III, p. 39 $5, 6, 7, 8, 9$: III, p. 41 $n! \text{ (n entier)}$: III, p. 41 $\binom{n}{p} \text{ (n, p entiers)}$: III, p. 42 $N, \aleph_0$: III, p. 45

$(x_n)_{\mathbf{P}\{n\}},\ (x_n)_{k\leq n},\ (x_n)_{n\geq k},\ (x_n):$ III, p. 45

$\prod_{\mathbf{P}\{n\}} X_n,\ \prod_{n=k}^\infty X_n:$ III, p. 45

$f^n\ (f\text{ application}):$ III, p. 47

$\lim E_\alpha\ (\text{E}_\alpha\text{ ensembles}):$ III, p. 52

$\lim u_\alpha\ (u_\alpha\text{ applications}):$ III, p. 54

$\lim_{\alpha,\lambda} E_\alpha^\lambda,\ \lim_{\alpha} E_\alpha^\lambda,\ \lim_{\alpha,\lambda} u_\alpha^\lambda,\ \lim_{\alpha} u_\alpha^\lambda:$ III, p. 56–57

$\lim E_\alpha\ (\text{E}_\alpha\text{ ensembles}):$ III, p. 61

$\lim u_\alpha\ (u_\alpha\text{ applications}):$ III, p. 63

$\lim_{\alpha,\lambda} E_\alpha^\lambda,\ \lim_{\alpha} E_\alpha^\lambda,\ \lim_{\alpha,\lambda} u_\alpha^\lambda,\ \lim_{\alpha} u_\alpha^\lambda:$ III, p. 66–67

$\sum_{i\in I} E_i\ (\text{somme ordinale}):$ III, p. 70, exerc. 3

$\mathrm{Is}(\Gamma,\Gamma'),\ \mathrm{Ord}(E),\ \lambda < \mu,\ \sum_{i\in I} \lambda_i,\ \mathbf{P} \lambda_i,\ \lambda + \mu,\ \mu\lambda,\ \lambda^*\ (\lambda,\mu,\lambda_i,\mu_i\text{ types d'ordre}):$ III, p. 76–77, exerc. 13

$\xi^n\ (\xi,\eta\text{ ordinaux}):$ III, p. 79, exerc. 18

$\omega_\alpha,\ \aleph_\alpha\ (\alpha\text{ ordinal}):$ III, p. 87, exerc. 10.

$S(E_1,\ldots,E_n)\ (S\text{ schéma de construction d'échelon, }E_1,\ldots,E_n\text{ ensembles}):$ IV, p. 2

$\langle f_1,\ldots,f_n\rangle^S\ (S\text{ schéma de construction d'échelon, }f_1,\ldots,f_n\text{ applications}):$ IV, p. 2