Set Theory and the Analyst

This survey is motivated by specific questions arising in the similarities and contrasts between (Baire) category and (Lebesgue) measure -- category-measure duality and non-duality, as it were. The bulk of the text is devoted to a summary, intended for the working analyst, of the extensive background in set theory and logic needed to discuss such matters: to quote from the Preface of Kelley [Kel]:"what every young analyst should know".

; compare the separable approximations in group theory [MonZ,Ch. II §2.6]) where DC suffices. On occasion, it has been possible to remove dependence on the Hahn-Banach theorem, a close relative of AC.
For the relative strengths of the usual Hahn-Banach Theorem HB and the Axiom of Choice AC, see [Pin1,2]; [PinS] provide a model of set theory in which the Axiom of Dependent Choices DC holds but HB fails. HB is derivable from the Prime Ideal Theorem PI, an axiom weaker than AC : for literature see again [Pin1,2]; for the relation of the Axiom of Countable Choice, ACC (below), to DC here, see [HowR]. Note that HB for separable normed spaces is not provable from DC [DodM,Cor. 4], unless the space is complete -see [BinO10].
When category methods fail, e.g. on account of 'character degradation', as when the limsup operation is applied to well-behaved functions (see §9), the obstacles may be removed by appeal to supplementary set-theoretic axioms, so leading either beyond, or sometimes away from, a classical setting. This calls for analysts to acquire an understanding of their interplay and their standing in relation to 'classical intuition' as developed through the historical narrative. Our aim here is to describe this hinterland in a language that analysts may appreciate.
We list some sources that we have found useful, though we have tried to make the text reasonably self-contained. From logic and foundations of mathematics, we need AC and its variants, for which we refer to Jech [Jec1]. For set theory, our general needs are served by [Jec2]; see also Ciesielski [Cie], Shoenfield [Sho], Kunen [Kun3]. For descriptive set theory, see Kechris [Kec2] or [MarK]; for analytic sets see Rogers et al. [Rog]. For large cardinals, see e.g. Drake [Dra], Kanamori [Kan], Woodin [Woo1].
The paper is organised as follows. After a review of the early history of the axiomatic approach to set theory (including also a brief review of some formalities) we discuss the contributions of Gödel and Tarski and their legacy, then of Ramsey and Erdős and their legacy. We follow this with a discussion of the role of infinite combinatorics (partition calculus) and of the 'large cardinals'. We then sketch the various 'pre-Cohen' expansions of Gödel's universe of constructible sets L (via the ultrapowers of Łoś, or the indiscernibles of Ehrenfeucht-Mostowski models, and the insights they bring to our understanding of L). This is followed by an introduction to the 'forcing method' and the generic extensions which it enables. We describe classical completeness depends on which ω-sequences are available. Accordingly, the problems that confront the working analyst split, into two types. Some (usually the 'less detailed') do not hinge on cardinality, and for these the reals retain their traditional canonical status. By contrast, some do hinge on cardinality; these are the ones that lead the analyst into set-theoretic underpinnings involving an element of choice. Such choices emphasise the need for a plural approach, to axiomatic assumptions, and hence to the status of the reals. This is inevitable: as Solovay [Sol1] puts it, 'it (the cardinality of the reals) can be anything it ought to be'.
We turn now to the second of the 'elephants' above: which sets of reals are available. The spectrum of axiom possibilities which we review in §10 extends from the 'prodigal' (below -see §2) AC at one end (which yields for example non-measurable Vitali sets) to the restrictive DC with additional components of LM ('all sets of reals are measurable') and/or PB ('all sets of reals have the Baire property') at the other, and include intermediate positions for the additional component such as PD ('all projective sets of reals are determined'), where the sets of reals with these so-called 'regularity properties' are qualified (see § §7 and 9).
Underlying an analysis of these axioms is repeated appeal to simplification of contexts -a mathematical ex oriente lux -typified by passage to a 'large' homogeneous/monochromatic subset, as in Ramsey's Theorem on N ( §4a). This has generalizations to large cardinals κ, in particular ones that support a {0, 1}-valued measure (equivalently, a 'suitably complete' ultrafilter -see below). On the one hand, the latter permits an extension of Suslin's classical tree-like representation of an analytic set ( §7) to sets of far greater logical complexity by witnessing membership of a set by means of infinite branches in a corresponding tree that pass through 'large' sets of nodes at each height/level (see §7). On the other hand, in the context of the 'line' of ordinals, one meets other forms of isomorphic behaviour on 'large' sets: on closed unbounded subsets of ordinals and on the related stationary sets ( §5b, 6b).
Notes. 1. This survey arose out of our decade-long probing of questions in regular variation [BinGT]. In [BinO3] we needed to disaggregate a classical theorem of Delange (see [BinGT,Th. 2.01]); the category and measure aspects need different set-theoretic assumptions. We regard the category case as primary, as one can obtain the measure case from it by working bitopologically (passing from the Euclidean to the density topology; see [BinO2,7,8]); also, measure theory needs stronger set-theoretic assumptions than category theory ( §10.2 and §10.3 below). If one replaces the limits in regular variation by limsups, the Baire property or measurability may be lost; the resulting character degradation is studied in detail in [BinO3 §3,5 §11].
2. We close by a brief mention of 'yet another elephant in the room'. One can never prove consistency (of sets of rich enough axioms), merely relative consistency. This is related to Gödel's incompleteness theorems ( §3). Thus we do not know that ZF or ZFC itself is consistent; this is something we have to live with; it is no reason to despair, or give up mathematics; quite the contrary, if anything. In what follows, 'consistency' means 'consistency relative to ZF'.

Early history
A little historical background may not come amiss here. The essence of analysis -and the reason behind the Hardy quotation that we began withis its concern with infinite or limiting processes -most notably, as in calculus, our most powerful single technique in mathematics (and indeed, in science generally). Life being only finitely long, the infinite -actual or potentialtakes us beyond direct human experience, even in principle. This underlies the unease the ancient Greeks had with the irrationals (or reals), and why they missed calculus (at least in its differential form, despite their success with areas and volumes under the heading of the 'method of exhaustion'). One can see, for example in the ordering of the material in the thirteen books of Euclid's Elements, that they were at ease with rationals, and with geometrical objects such as line-segments etc., but not with reals. Traces of this unease survive in Newton's handling of the material in his Principia, where he was at pains to use established geometrical arguments rather than his own 'method of fluxions'. That there was unfinished business here shows, e.g., in the title of a work of one of the founding fathers of analysis, Bolzano, with his Paradoxien des Unendlichen (1852, posthumous). The bridge between the real line and the complex plane (the 'Argand diagram ' -Argand, 1806, Wessel, 1799, Gauss, 1831 pre-dated this. The construction of the reals came independently in two different ways in 1872: Dedekind cuts (or sections), which still dominate settings where one has an order, and Cantor's construction via (equivalence classes of) Cauchy sequences (of rationals)still ubiquitous, as the completion procedure for metric spaces.
Cantor. Cantor's work, in the 1870s to 1890s, established set theory (Mengenlehre) as the basis on which to do mathematics, and analysis in particular. Here we find, for example, the countability of the rationals, and of the alge-braic numbers (Cantor, 1874) and the uncountability of the reals (Cantor, 1895), established via the familiar Cantor diagonalisation argument. But note what is implicit here: Cantor diagonalisation (as used, say, to prove the countability of the rationals) is an effective argument. But to move from this to saying that 'the union of countably many countable sets is countable' (Cantor, 1885) needs the Axiom of Countable Choice (ACC), below.
Hilbert. Moving to the 20th century: Hilbert famously said (in defence of Cantor against Kronecker): 'No one shall expel us from the paradise that Cantor has created for us'. Hilbert addressed himself to the programme of re-working the mathematical canon of its time to (then) modern standards of rigour, witness his books on the foundations of geometry [Hil1,2,3] (1899) and of mathematics [HilB] (1934, 1939, cf. the Hilbert problems of 1900. As we shall see, Hilbert was a man of his time here, and his views on foundational questions were too naive. Meanwhile, Lebesgue introduced measure theory in 1902, Fréchet metric spaces in 1906, and Hausdorff general topology in 1905-1914 (three very different editions of his classic book Grundzuge der Mengenlehre appeared in 1914Mengenlehre appeared in , 1927Mengenlehre appeared in and 1935. Hilbert space emerged c. 1916 (work of Hilbert and Schmidt; named by F. Riesz in 1926). Banach's book [Ban] appeared in 1932, effectively launching the field of functional analysis; this magisterial work is still worth reading. But, Banach was a man of his time; he worked sequentially, rather than using the language of weak topologies, presumably because he felt it to be not yet in final form. However, the language and viewpoint of general topology was already available, and already a speciality of the new Polish school of mathematics, of which Banach himself was the supreme ornament. For a scholarly and sympathetic account of these matters, see Rudin [Rud, Appendix B].
The need for care in set theory had been dramatically shown by the Russell Paradox of 1902, and its role in showing the limitations of Frege's programme in logic and foundations, especially his Grundgesetze der Arithmetik (vol. 2 of 1903). The Paradox, far from being a programme wrecker, was pregnant with consequences [GabW], just as with Gödel's work later (below), and that too was ultimately based on a Paradox (the 'Liar paradox'). See [Hall2] for a discussion. Foundational questions had been addressed in 1889 by Peano. Zermelo began his axiomatisation, and gave the Axiom of Choice (AC) in 1902. Fraenkel, Skolem and others continued and revised this work; what is known nowadays as Zermelo-Fraenkel set theory (ZF), together with ZF+AC, or ZFC, emerged by 1930 or so. AC is most often used in the (equivalent) form of Zorn's Lemma of 1935 (a misnomer, as the result is due to Kuratowski in 1922, but the usage is now established). It will be helpful for later passages to note that the axioms include the operations of comprehension (the forming of a subset determined by a property), union and power set (denoted here by ℘), as well as foundation/regularity, asserting the well-foundedness of the relation of membership ∈ (no descending ∈-chains). In this context AC is a generator of sets par excellence, with effects of both positive and negative aspects: allowing the construction both to 'satisfy intuition' (as in the construction of 'invariant means') and to astound it (as in the Banach-Tarski paradox): see the comments in [TomW,Ch. 15]. The tension between 'too many' sets or 'too few' pervades the history of set theory through the lens of logic, all the way back to Cantor: see [Hall1]. For a discussion of approaches to axiomatization see [Sco2].
Brouwer. The interplay between analysis (specifically, topology) and foundations in this era is well exemplified by the work of Brouwer. Brouwer is best remembered for two contributions: his fixed-point theorem (of 1911, [Bro1]), and Intuitionism (1920, cf. [Bro2]). The first is beloved of economists, as it provides existence proofs of economic equilibria -the 'invisible hand' of Adam Smith, and his later 'disciples'. But, his proof of the fixed-point theorem was a non-constructive existence proof, and Brouwer lost faith in these for foundational reasons. He reacted by seeking to re-formulate mathematics 'intuitively', on new foundations -differing from those in use then and now by, for instance, outlawing proof by contradiction. This led to serious conflict, for instance the Annalenstreit (Annals struggle) [Neu2], 1928), and work on amenable groups, with applications to the 'Banach-Tarski paradox' (as above) ( [TomW]; [Bin]).
The sets x in Von Neumann's definition are ordered by ∈ and are transitive: if z ∈ y ∈ x, then z ∈ x. Indeed the ordinals, which form the class On (not a set), are initially introduced as transitive well-ordered structures x, ∈ x with ∈ x the restriction to x of the membership relation. Once ordinals α are established (this uses the axiom of regularity), the cumulative hierarchy V α may be introduced inductively so that V α+1 = ℘(V α ), with ℘ the power set operation, and V λ = {V α : α < λ} for λ a limit ordinal. The class of sets is then V = {V α : α ∈ On}, and each set x has a well-defined The formal language of set theory LST builds formulas from a defined sequence of free variables (e.g. v 0 , v 1 , ...), the atomic ones taking the form x ∈ y and x = y, with x and y standing for free variables; the syntactically more complex ones then arise from the usual logical connectives and quantifiers (∀x and ∃y -creating bound variables from the free variables x, y). The idea is that the free and bound variables are restricted to range only over the elements in the universe of discourse (thus yielding a 'first-order' language). This language is a necessary ingredient of the axiomatic method, its first purpose being to give meaning to the notion of 'property' (so that e.g. {x ∈ y : ϕ(x)} is recognized as a set when ϕ is a formula with one free variable x).
The language LST is minimal as compared to the language of, say, group theory, whose type (officially: 'signature') involves more items (a designated constant 1, functions like y • z , relations, etc). Each such language is interpreted in a mathematical structure; for instance, at its simplest a group structure has the form G := G, 1 G , • G , · −1 and so lists its domain, designated elements and operations. Below structures are assumed to be sets unless otherwise qualified; it is sometimes convenient (despite formal complications) to allow a class as a domain, e.g. V, ∈ .
The (metamathematical -i.e. 'external' to the discourse in the language) semantic relation |= of satisfaction/truth (below), due to Tarski (see [Tar2], cf. [BelS,Ch. 3 §2]), is read as 'models', or informally as 'thinks' (adopting a common enough anthropomorphic stance). A formula ϕ of LST with free variables x, y, ..., z may be interpreted in the structure M := M, ∈ M (with ∈ M now a binary set relation on the set M) for a given assignment a, b, ..., c in M for these free variables, and one writes M |= ϕ(x, y, ..., z)[a, b, ..., c], or by abbreviation M |= ϕ [a, b, ..., c] if the property holds; this requires an induction on the syntactic complexity of the formula starting with the atomic formulas (for instance, the atomic case x ∈ y is interpreted under the assignment a, b as holding iff a ∈ M b ). Compare the reduction of complexity in the forcing relation of §6 below.
This apparatus enables definition of 'suitably qualified' forms of 'definability'; by contrast, unrestricted 'definability' leads to such difficulties as the 'least ordinal that is not definable', so is to be avoided (compare §3 below with Tarski's undefinability of truth). A simple example is that of an element w ∈ M being definable over M from a parameter v ∈ M, in which case for some formula ϕ(x, y) with two free variables: Thus Gödel introduced the constructible hierarchy L α by analogy with V α : however, L α+1 comprises only sets definable over L α from a parameter in L α ; here L λ = {L α : α < λ} for λ a limit ordinal, a matter we return to later, yielding the class L = {L α : α ∈ On}.
Certain formulas, like ϕ(x, y) above (which can be explicitly, and so effectively, enumerated, as ϕ m say), may give rise via the substitution of a parameter v for y to a family of not necessarily unique elements u ∈ M satisfying ϕ (u, v). An appeal, in general, to AC but in the 'metamathematical' setting (i.e. the context of the mathematics studying relations between the language and the structures), selects a witness w of the relation ϕ (x, v) holding in M: the function v → w is called a Skolem function (for M and ϕ); we will see a striking application presently -for background on this key notion see e.g. [Hod]. Evidently, a structure like M := L α , ∈ Lα contains enough well-orderings of its initial parts L β for β < α (induced by the enumeration ϕ m and well-ordering of the ordinal parameters) that reference to AC here becomes unnecessary. (Incidentally, this is why AC holds in the class structure L, ∈ .) We will refer to some other definability classes below in §6, so as an introduction we mention two classical ones. The class OD of ordinally definable sets comprises those that are definable from ordinal parameters over V α , ∈ Vα for some α. An element of a set in OD need not itself be in OD; the class HOD is the smaller class of those elements x whose transitive closure consists entirely of sets in OD, so HOD is a transitive class; see [MyhS] for a discussion.
In view of the finitary character of formulas, the Löwenheim-Skolem-Tarski theorem (see e.g. [Hod], or [BelS,Ch. 4.3]), as applied to the language of set theory LST , asserts that if a set Σ of sentences is modelled in a structure M, then there exist structures N of any infinite cardinality satisfying Σ, including countable ones. The latter ones are generated by induction by iterative application of all the Skolem functions; so this needs only the Axiom of Dependent Choices. A familiar example is the countable subring with domain Q of the ordered ring structure R, 0, 1, +, ×, < . Passing to above-continuum cardinalities yields models of non-standard analysis with infinitesimals and infinite integers (see below); but here AC is needed to construct Skolem functions with which to generate the much larger structure.
The axioms of set theory include a finite set and an axiom schema corresponding to the Axiom of Replacement (which asserts that the image of a set under a functional relation ϕ(x, y) expressed in LST is again a set). In order to model these axioms in structures like M, ∈ M with M a set, it is necessary to restrict attention to the use of a finite number of instances of the axiom schema -causing no practical loss of generality, since any amount of mathematical argument will necessarily do just that (for instance, a deduction of an inconsistency). Thus, assuming the consistency of the axioms of set theory, any finite subset of the axioms has a model M (by the Gödel-Henkin Completeness Theorem; see e.g. [BelS,Th. 4.2]) and so also a countable model N . This is conventionally and systematically rephrased as saying that the axioms of set theory have a countable model; compare [Kun2,Ch. 7 §9].
By its very nature the countable model N will contain far fewer bijections than exist in Cantor's world V. If transitive, the domain N of N will have an initial segment of the ordinals in V ; however, there will be countable ordinals which N 'thinks' are uncountable, owing to missing bijections. The rule to observe is that ordinals are absolute whereas cardinality is relative. This is exploited in arranging the failure of the Continuum Hypothesis, CH, by the model extension process of forcing (see below for details and references). In the context of a transitive model of set theory M we will write e.g. ω M 1 for the ordinal which in M is its first uncountable. In the absence of a superscript the implied context is V.
Provided the Regularity axiom is included, the structure N = N, ∈ N , being then well-founded, is isomorphic to a transitive structure; the isomorphism π is given inductively by: and is known as the Mostowski collapse. Thus, for example, π(∅ M ) = ∅.

Gödel, Tarski and their legacy
The use of formal language brought greater clarity to the axiomatic method: thus Skolem helpfully clarified one of Zermelo's axioms by replacing the latter's use of the informal notion of 'definite property' with a formal rendering (i.e. by reference to formulas in a formal language). This was soon to be followed by the discovery of the limitations of formal language: the publication in 1931 of Gödel's two incompleteness theorems, preceded by the results of his 1930 thesis on the completeness of first-order logic (that every universally valid sentence is provable - [BelS,Th. 12.1.3]) and on compactness (a corollary). The latter was to bear fruit at the hands of Tarski much later (1958 on). We note that the Compactness Theorem for predicate calculus (that a set of sentences has a model iff each finite subset has a model [BelS,Ch. 5 §4]), Tychonov's Theorem in topology and AC are deeply connected; see [Jec1]. See also [BelS,Ch. 5 esp. §5] for the status of variants and the connection with the ultraproducts of §5 below.
The two incompleteness theorems concerning any axiomatic system rich enough to encompass arithmetic (firstly, the existence in the formal language of the axioms of sentences that can be neither proved nor disproved, and secondly, the impossibility of such a system to provide a proof for its own consistency), rather than just wreck Hilbert's programme, produced untold benefits to the richness of mathematics: the plurality of the possible interpretations of a set of axioms (as in Skolem's non-standard arithmetic), and the accompanying search for choosing the ways to reduce incompleteness, on the one hand, and to test or justify any belief in consistency, on the other: especially in the case of the axioms of set theory. See [Ste].
Gödel's enduring insight was the embedding by arithmetic coding (hence the need for the 'rich enough' presence of arithmetic) of (aspects of) a 'metalanguage' -the informal language of discourse needed to examine a formal language as a mathematical entity -back into the formal language, specifically the concepts of proof and provability -see below.
Addressing the incompleteness of set theory, Gödel's second legacy relates to 'relative consistency ': proof in 1938 (published in 1940) of the consistency relative to ZF of both AC -a matter of supreme importance, given the Banach-Tarski paradox (dating back to 1924) -and of GCH. The key idea in the proof was the introduction (see §2 above) of the cumulative hierarchy L α of constructible sets whose totality comprising the class L is an inner model (i.e. a subuniverse of the universe V of von Neumann, specifically a transitive class containing On). This was to be the foundation stone for the advances of the 'next one hundred years' in two ways. The first was to invite extensions of L by appropriate choice of sets outside L. The second, more technical, derives from Skolem's method (1912) of constructing countable sub-models, enshrined in a condensation principle, that if M is a countable 'submodel' of L (more accurately an 'elementary substructure'), then it is isomorphic to a set L α .
Contemporaneously with Gödel's earliest contributions, and blending and intertwining with them, there occurs a 'volcanic eruption' of ideas and re-sults from the fertile mind of Tarski: bursting forth in 1924 with the Banach-Tarski paradox (mentioned above) and evidenced by the working seminars of 1927-1929, laying the foundations of Tarski's remarkable legacy, both that published in its time and that published later. This included work on the definability or otherwise (definable if 'external', not if 'internal') of the concept of truth, a result closely allied to Gödel's incompleteness result and of similar vintage. Suffice it to point to the role of 'elementary substructure' (term due to Tarski) in the condensation principle above.
Deficiencies in Hilbert's approach to geometry (e.g., its tacit assumption of set theory) led Tarski to re-examine the axiomatic basis of geometry. In 1930 Tarski was able to prove the decidability of 'elementary geometry', via a reduction to 'elementary algebra' where he was able to generalize Sturm's algorithm for counting zeros of polynomials -see [Vau] for references and [SolAH] for recent developments in this area.

Ramsey, Erdős and their legacy: infinite combinatorics; partition calculus and large cardinals 4a. Ramsey and Erdős
Pursuing a special case of Hilbert's Entscheidungsproblem of 1928 -proposing the task of finding an effective algorithm to decide the validity of a formula in first-order logic -Ramsey was led to results in both finite and infinite combinatorics (obtained late that same year, and published in 1930, [Ram]), the finite version of which yielded the desired algorithm for the special ("though common") universal type of formula. In general no computable algorithm exists, as was shown by Church (using Gödel's coding) in 1935, and independently by Turing in 1936 (via Turing machines). The Infinite Ramsey Theorem (which acted as a paradigm for its finite variants) asserts in its simplest form that if the distinct unordered pairs (doubletons) of natural numbers are partitioned into two (disjoint) classes, then there exists an infinite subset M ⊆ N all doubletons from which fall in the same class; thus M, which may be said to be a homogeneous (monochromatic) subset for the partition, is large -see [Dra,Ch. 2.8.1, Ch. 7.2 which both use DC]. (Homogeneity is a constantly recurring theme in what follows.) Thus, as a corollary, a Cauchy sequence in R contains either an increasing or a decreasing subsequence. The combinatorial result extends from doubletons to (unordered) n-tuples (called by Ramsey 'combinations') and from dichotomous partitions to ones allowing any finite number k of partitioning classes. Further analogues and generalizations form the discipline of partition calculus, the founding fathers of which were Paul Erdős and Richard Rado: see [ErdR].
Given its origins, it is not altogether surprising that Ramsey's theorem and its generalizations continue to play a key role in the logical foundations of set theory.

4b. Partitions from large cardinals
We are particularly concerned below with the partition property that follows. As usual we regard any ordinal (including any cardinal) as the set of its predecessors. The partition property (partition relation) of concern is κ → (α) <ω 2 , by which is meant that if [κ] <ω (the finite subsets of κ) is partitioned into two classes, then there is a homogeneous subset of κ of order type α. (Ramsey's result as stated above is recorded in this notation as ω → (ω) 2 2 , and its immediate generalization to n-tuples and k classes as ω → (ω) n k .) For any α ω the least cardinal κ for which κ → (α) <ω 2 holds, denoted κ(α), is called the α-th Erdős cardinal (or partition cardinal ); but do such cardinals exist? One may show in ZFC that κ(α), if it exists, is regular (below), and when α is a limit ordinal, that κ = κ(α) is strongly inaccessible (below) [Dra,Ch. 10], and so V κ is a model of ZFC, written V κ |=ZFC. Hence, by Gödel's incompleteness theorem, we cannot deduce its existence in ZFC.
Of particular importance are cardinals κ, in particular κ = κ(ω 1 ), for which κ → (ω 1 ) <ω 2 holds: see the next section. So if, as we do, we need them, then we must add their existence to our axiom system. To gauge the consistency strength of this assumption we refer to one of the earliest notions of a 'large cardinal': a measurable cardinal κ. Such a cardinal was defined by Ulam [Ula] in 1930 by the condition that it supports a {0, 1}-valued κadditive (i.e. additive over families of cardinality λ, for all λ < κ) non-trivial measure on the power set ℘(κ). This may be reformulated as asserting the existence of a κ-complete ultrafilter on κ ( [Car2], [ComN], [Jec2], [GarP]). It turns out that for κ measurable, the stronger relation κ −→ (κ) <ω 2 holds. The latter is taken as the defining property of a Ramsey cardinal, through its similarity with ω → (ω) 2 2 . We stop to notice that the relation κ → (κ) 2 2 (taken to be the definition of a weakly compact cardinal [Dra,Ch.10.2]) holds iff κ is strongly inaccessible and κ has the tree property: every tree of cardinality κ having less than cardinality κ nodes at each level has a path, i.e. a branch of full length κ. It is interesting that, as with the Cauchy sequences in R above, if κ → (κ) 2 2 , then every linearly ordered set of cardinality κ has a subset of cardinality κ which is either well-ordered or reversely well-ordered by the linear ordering.

4c. Large cardinals continued
The first notion of a large cardinal is motivated by the conceptual leap from the finite to the infinite, as exemplified by the set of natural numbers viewed as N, or, better for this context, as the first infinite ordinal ω. The arithmetic operations of summation and multiplication/exponentiation (equivalently, the power set operation ℘) applied to members of ω lead to members below ω.
This observation can be copied by a direct reference to the two corresponding operations that generate a union of a given family and the power set of a given set, each operation being guaranteed by the corresponding axiom. Thus a cardinal is said to be weakly inaccessible if it is a limit cardinal above ω which is regular (a regular limit cardinal), meaning, firstly, that it is the limit, i.e. supremum (union), of all the preceding ordinals, and, secondly, that nonetheless it is not the union (supremum) of a smaller family of ordinals. A cardinal κ is strongly inaccessible, or just (plain) inaccessible, if it is a regular strong limit cardinal, i.e. additionally 2 λ < κ for all λ < κ. (Here 2 λ is the cardinality of ℘(λ).) Further such notions (of hyper-inaccessibility), which we omit here, have been introduced by reference to the idea of a 'large limit' (limit over a large set) of 'large cardinals'. The axioms ZFC, assumed consistent, cannot imply the existence of an inaccessible κ, as then V κ , being a model for ZFC, provides proof within ZFC of the consistency of ZFC, a contradiction to Gödel's incompleteness theorem.
A second source of largeness is motivated by the study of infinitary languages, the idea being to overcome some of the limitations of first-order languages. For example, in the language L κκ one admits κ many free variables and permits infinite conjunctions/disjunctions of a family of formulas of cardinality below κ. This leads to the desirability of these languages having a compactness property analogous to Gödel's compactness property of the ordinary language L ωω (see above). Examples of the failure of compactness abound; so it emerges that the desired κ, if it exists, needs to be large. Thus a cardinal κ is called strongly compact [Dra,Ch. 10.3] if the language L κκ is (λ, κ)-compact for each λ κ, that is: for each λ κ and any set Σ of sentences in that language with |Σ| λ, if each subset Σ ′ with |Σ ′ | < κ has a model, then Σ has a model. (So the cardinality of Σ here is not constrained.) The property may be characterized without reference to the language more simply as saying that every κ-complete filter can be extended to a κ-complete ultrafilter.
Analogously, a cardinal κ is weakly compact [Dra,Ch. 10.3] if the language L κκ is (κ, κ)-compact: if any set of sentences Σ with |Σ| κ such that each of its subsets of cardinality < κ has a model, then Σ has a model.
A third, more promising, source is more in keeping with the first ('operational') viewpoint. It is motivated by the 'substructures' analysis initiated in Gödel's proof that GCH holds in the universe of constructible sets. Attention focusses now on the properties that the operation of elementary embedding could or should have. We recall that the range of such an embedding is an elementary substructure. Suppose that j : N → M is an elementary embedding, where N and M are transitive classes and j is definable in N by a formula of set theory with parameters from N. Then j must take ordinals to ordinals and j must be strictly increasing. Also j(ω) = ω and j(α) α, so there is a least δ with j(δ) > δ. This is the critical point of j. Then In fact, the converse is also true -see [SolRK,Th. 1.2]. Interestingly, here a non-principal ultrafilter is defined by membership of a single point, albeit via images.
The significance of this characterization lies in the 'operations' the function j encodes which, on the one hand, pass the test of 'elementarity' and, on the other, introduce an upward jump at the critical point (roughly speaking, an 'inaccessibility from below by elementarity').
We mention some further canonical large-cardinal notions obtained from variations on this elementary embedding theme; these will be useful not only presently for the establishement of a reference scale of consistency strength, but also later in relation to the regularity properties of subsets of R (such as Lebesgue measurability etc., considered in §7 and 10).
For κ a cardinal and λ > κ an ordinal, κ is said to be λ-strong if for some transitive inner model ( §3), M say, there exists an elementary embedding This notion may be relativized to subsets S to yield the concept of λ-Sstrong by requiring in place of the inclusion above only that (One says that j preserves S up to λ.) This provides passage to our last definition. The cardinal δ is a Woodin cardinal if δ is strongly inaccessible, and for each S ⊆ V δ there exists a cardinal θ < δ which is λ-S-strong for every λ < θ.
The consistency strength of various extensions of the standard axioms ZFC, by the addition of further axioms, may then be compared (perhaps even assessed on a well-ordered scale) by determining which canonical largecardinal hypothesis will suffice to create a model for the proposed extension. Thus, for κ supercompact, V κ |= ∃µ["µ is strong"], which places supercompact above strong. Likewise, for κ strong, V κ |= ∃µ["µ is measurable"], placing measurability below strong. (And below that is the existence of a Ramsey cardinal, recalling earlier comments.) The consistency of Woodin cardinals is thus between strong and supercompact: diagramatically, supercompact > Woodin > strong > measurable > Ramsey.

Beyond the constructible hierarchy L -I
We have mentioned the Löwenheim-Skolem-Tarski theorem. How else may one construct structures that will contain a given one as an elementary embedding? In topology one naturally reaches for powers and products (as with Tychonov's theorem), and also their various substructures such as function spaces. For example, Hewitt [Hew] in 1948 constructed hyper-real fields by using a quotient operation on the space of continuous functions via a maximal ideal; cf. [DalW2].

5a. Expansions via ultrapowers and intimations of indiscernibles
Jerzy Łoś [Łoś] in 1955, though foreshadowed by Skolem's construction [Sko] of non-standard arithmetic in 1934, and even Gödel 1930, introduced a natural algebraic way of constructing new structures. Łoś relied on the concept, introduced in 1937 by Cartan [Car1,2], of ultrafilter : a maximal filter in the power set of I, say. (The assumption of the existence of these -see PI in §1-is in general weaker than AC.) For a family of structures A i : i ∈ I , all of identical type/signature, i.e. each having the same distinguished operations and relations on its domain A i (and possibly distinguished elements), one first defines the direct product as a structure (again of the same type) with domain the set i∈I A i (the product's existence in general implicitly invoking AC, of course) by defining the operations and relations pointwise; thus any distinguished element e, say, if interpreted in A i as e i , say, is interpreted in the product by the function e : i → e i . Next, for U an ultrafilter on I, define U-equivalence: f ∼ g according as {i ∈ I : f (i) = g(i)} ∈ U, i.e. f and g are pointwise U-almost equal. Then denote by i∈I A i /U the equivalence classes [f ] U and equip these with the requisite operations and relations suitably interpreted as relations that hold pointwise U-almost always.
By induction from the construction of these 'atomic' cases of relations, Łoś's Theorem (ŁT below) asserts satisfaction in the ultraproduct of general properties/formulas ϕ, say for simplicity with one free variable v, via for ϕ any first-order formula (in the language needed to describe a structure of that type -'signature' above).
If the A i = A are all equal (with domain A), then A embeds elementarily into the ultrapower A I /U, when a ∈ A is identified with the constant map f a : i → a.
Consider A := R, +, ·, , 0, 1 , I = N and U an ultrafilter extending the filter of co-finite subsets of N (again invoking, say, AC). Then, R embeds in R I /U , with any real number a represented by the constant function f a : n → a. Let us call the function id(i) := i for i ∈ I a dominating function since it plays an important role and dominates any constant function f m for m ∈ N; indeed, [f m ] U [id] U , since {n : m n} ∈ U, and so id is an element following all of N, and so follows all of R in R I /U. That is, id identifies an infinite number ; likewise 1/id identifies a positive (non-zero) element that may be interpreted as an infinitesimal. (This observation allowed Abraham Robinson [Rob1,2] to develop a non-standard analysis within which to interpret and interrogate rigorously Leibniz's intuitive texts on infinitesimals; see [Kei] for an undergraduate rigorous development of calculus in this setting.) The argument just given may be repeated with A := A, ∈ A for A a transitive set and ∈ A the relation of membership in A. If A is a countable model of ZF, then, provided U is countably complete (see e.g. [Kan,Prop. 5.3]), A I /U is well-founded under its 'interpretation of the membership relation', so will contain elements that form an interval of ordinals following the ordinals in A. However, there are no means within A itself of 'seeing' the existence of this extra layer of ordinals: speaking informally (but see below), they are 'indiscernible'. (Strictly speaking, A I /U needs to be replaced by an isomorphic structure which is a transitive set, known as the Mostowski collapse, defined inductively by the collapsing function π: ; then interpretations of ordinals collapse to actual ordinals.) When I = κ with κ the least measurable cardinal and U the (κ-complete) corresponding ultrafilter, Dana Scott considered the extension of L to L[U] (the Lévy class of sets 'constructible relative to' U -obtained by allowing definability over the ordinals to refer also to U -so a class closed under the intersection with U; see [Kan, Ch. 1 §3], [Dra,5.6.2]), and investigated the ultrapower L[U] I /U to conclude the non-existence of a measurable cardinal in L. This is easiest to understand through the lens of the theorem that existence of a measurable cardinal contradicts V = L [Sco1], [Dra,6.2.10], [BelS, Ch. 14 §6] (so there is no measurable cardinal in L). This is done again by referring to the dominating function id(i) = i, which vies with κ for the place of smallest measurable cardinal (in the Mostowski collapse). A proper proof needs to avoid doubtful manipulations of U-equivalence classes of subclasses of L [U]. (To achieve this, one represents any function f by one of least rank U-equivalent to it -the 'Scott trick'; under these circumstances wellfoundedness of the resulting model needs to be verified, using σ-additivity of U.) The gist of the proof is to recreate the following contradictions stemming from ŁT. As before, id(i) := i for i ∈ I, and f λ : i → λ is the constant function on I embedding λ into the ultrapower. By ŁT, the map {i ∈ I : λ < i} = κ\(λ + 1) ∈ U, as U is κ-complete). But {f λ : λ < κ} has cardinality κ, and so κ id, contradicting the earlier deduction that id < κ.
Actually, these observations just demonstrate that the embedding j = j U obtained by composing λ → f λ with the Mostowski collapse satisfies j(λ) = λ for λ < κ, and j(κ), being the collapsed version of [id], lies strictly above κ; thus the ordinal κ is the critical point of j.
This argument was further investigated by Haim Gaifman, from the point of view of iterating the ultrapower construction, and perfected by Kunen [Kun1].

5b. Ehrenfeucht-Mostowski models: expansion via indiscernibles
At about the same time as Łoś introduced ultraproducts into modeltheory, Ehrenfeucht and Mostowski [EhrM] in 1956 introduced a construction that expands a structure A by importing a linearly ordered set of elements in such a way that, speaking anthropomorphically, A is incapable of distinguishing between these imports and a certain infinite subset of its own domain. Less than a decade later, first Morley in 1962 (see e.g. [Mor]) and then Silver in his thesis in 1966 (see [Sil]) put these features to decisive use, by enabling the imported elements to generate various kinds of information about A consistent with that generated by A on its own.
The original construction provided an elementary embedding of any infinite structure A into another 'larger' one -larger in possessing many non-trivial automorphisms, securing in particular a non-trivial elementary embedding. A (copy of a) linearly ordered set X is adjoined to A of elements x which are to be 'indiscernible' from the viewpoint of A (except only in name -as the formal language must adjoin formal names c x to speak about them) in the sense that: , for all formulas ϕ having n free variables, for all n, and all x 1 < ... < x n < x ′ 1 < ... < x ′ n in X. That this is possible in general relies on the Compactness Theorem (and so on AC): the idea here being that if one takes the sentences true in A together with sentences ϕ(c x 1 , ..., c xn ) ⇔ ϕ(c x ′ 1 , ..., c x ′ n ) (also the inequalities c x = c y ), then one may satisfy a finite set F of these by interpreting the finite number m of c x s in play in F , c x 1 , ..., c xm say, with suitably chosen elements of A, as follows. To effect the choice, partition all m-tuples of A according as to whether or not A can distinguish between them on the basis of the properties defined by the finite number of formulas ϕ(v 1 , ..., v m ) obtained from the ϕ in F. (That is: the free variables v i replace the constants c x i .) Then an infinite homogenous set for this partition yields a model for F.
In particular, for limit ordinal δ, the structure A = L δ , ∈ (by abuse of notation ∈ here and below denotes membership ∈ restricted to L δ ) can be expanded to a structure with a sequence of indiscernibles whose formal language names are c n . Call that A 0 . (Here AC may be avoided, as L δ is well-ordered.) In turn, for any ordinal α, that expanded structure A 0 may be further extended to a structure M α (A) with a set of indiscernibles X of order type α and with the following additional property: for any formula in the language of L δ , ∈ , ϕ(v 1 , ..., v n ) say, So, in particular, the indiscernibles X can generate all the true sentences about A. But are the structures M α (A) well-founded for all α? That depends on whether the structures M α (A) for just α < ω 1 are all well-founded (the reduction here is possible, since any descending sequence occurring in the models with larger α can be captured by a countable submodel). This will be so when A = L κ , ∈ and κ satisfies the partition relation κ → (ω 1 ) <ω 2 . (With α < ω 1 as above, the argument is similar to but easier than that in the Ehrenfeucht-Mostowski result. Appealing to the partition relation above in place of Ramsey's theorem, partition (ξ 1 , ..., ξ n ) ∈ [κ] <ω dichotomously according as to whether M α |= ϕ(ξ 1 , ..., ξ n ) holds or not; extract an ω 1 homogeneous subset of κ and use its first α members as the required indiscernibles. Their Skolem hull in L κ , a well-founded set, is isomorphic to M α (A).) A first corollary (by appeal to indiscernibility, use of only the first ω indiscernibles, and then the countability of the formal language): only a countable number of subsets of ω are constructible in L, even though from the viewpoint of L there are uncountably many of them in L; but then, an embellishment of the analysis yields that ω L 1 , the ordinal intepreted by L as the first uncountable, is also countable.
Silver deduced deeper results about L along these lines. Some of these were then bettered by Kunen [Kun1], who devised a way for iterating the ultrapower construction of a structure M in a setting where the ultrafilter U need not be a member of M. A most remarkable contribution from Silver was the introduction of the set now called 0 # (zero-sharp) following Solovay (originally designated a 'remarkable' set); this is the set of Gödel codes ⌈ϕ⌉ for all the true sentences ϕ about L generated by the ω-sequence of indiscernibles {ω 1 , ω 2 , ..., ω n , ...}, namely: (x 1 , ..., x n ) for (x 1 , ..., x n ) ∈ {ω 1 , ω 2 , ..., ω n , ...}}.
(The notation tacitly assumes that n = n(ϕ) is the number of free variables in ϕ.) This set's very existence of course depends on suitable large-cardinal assumptions, such as κ → (ω 1 ) <ω 2 holding for some κ. The 'existence of 0 # ' can be used as a large-cardinal assumption in its own right, lying below the existence of the Erdős cardinal. Indeed, in §7 we discuss the classical theory of analytic sets and thereafter the determinacy of infinite positional games with a target set T, say; the assumption that sets with co-analytic target set are determined (Π 1 1 -determinacy) implies that 0 # exists, a result due to Harrington [Har].
We return to the indiscernibles for the structures A = L δ , ∈ , assuming the partition relation just mentioned, which had been studied initially by Gaifman and by Rowbottom. Silver's great contribution was to describe the structure, indeed the 'very good behaviour' (below), of a (proper) class X of ordinal indiscernibles: closed (under limits -i.e. under suprema), unbounded in any cardinal λ (with X∩λ of cardinality λ); with L α ≺ L β for α < β both in X (indeed, stretching the notation to class structures, with L α ≺ L); having the property that every set in L is definable from parameters in X. Among the significant consequeness is the, already mentioned, countability of those sets in L that are definable over L without any parameters (implying immediately that V = L), and more importantly the definability of truth in L. For details see e.g. [Dra,Th. 4.8]. We stress these results are subject to the partition assumption.
The point (above) about good behaviour concerns particularly the 'closed unbounded' nature of X above. Sets of ordinals with this property should be regarded as 'large', since they enable the very important 'stationary sets' of the next section to be thought of as non-negligible. The two concepts play a leading role in combinatorial principles (holding in L) isolated by Jensen (see e.g. [Dev1]) from the fine structure of L. These include Jensen's ♦ (diamond), used in constructing a 'Suslin continuum' as a counterexample to Suslin's hypothesis (see below); (square); derived ones like ♣ (club), introduced by Ostaszewski [Ost1] (in 'counterexample' constructions for general topology); and generalizations ♣ NS studied by Woodin [Woo1,Ch. 8]. Compare the use of NT (for No Trump) in [BinO1,4].

Beyond the constructible hierarchy L -II 6a. Forcing and generic extensions
The undisputed game-changer for set theory was Cohen's 'method of forcing', devised as a means of importing into a countable structure M = M, ∈ M additional sets from V \M (V contains the reals; M, being countable, does not), without disturbing the fact that M may be a model of ZF. Speaking anthropomorphically, the imported set may have the intention of introducing new information -say, the existence of a transfinite sequence of real numbers viewed by M as an ω M 2 sequence (reference here to the interpretation in M of the second uncountable cardinal), albeit viewed by V as a countable sequence -without nevertheless encoding such catastrophic information as that M itself is countable. Cohen described his method [Coh3] as ultimately analogous to the construction of a field extension: introduce a name for the algebraically absent element, and then describe its properties via polynomials in that element. In truth the extension method shares a family resemblance with non-constructive existence proofs, either via the Baire category method (the desired item has generic features), or the Erdős probabilistic method (measure-theoretic: the desired item has 'random' features). Indeed the two canonical instances of forcing to adjoin real numbers, Cohen's and Solovay's, are categorical (Cohen reals) or measure-theoretic ('random reals', or -perhaps better -'Solovay reals'). Indeed, following an idea of Ryll-Nardzewski and of Takeuti, Mostowski [Most] shows how to guide the selection of an imported set by reference to the points of a Baire topological space (one in which Baire's theorem holds); avoiding a specified meagre set ensures that the extension of M will be a model of ZF. The two canonical cases then correspond to two topological spaces. For an alternative unification see [Kun3].
One views the forcing method as acting 'over' a structure M by providing a set P in M of partial descriptions of a generic object G yet to be determined. P is thus rendered as a partially ordered set, and under its ordering relation q p is understood as saying that q contains more information about the object to be constructed than does p. There is a syntactic relation p ϕ for p ∈ P and ϕ a sentence, read as 'p forces ϕ', which may be 'explained' by an induction reminiscent of the Tarski inductive definition of truth (|=, in §2), but with significant differences (below).
Before embarking on the details, it is helpful to use an analogy with probability or statistical inference. Indeed p ∈ P is usually called a 'condition'; forcing is inspired by the language of 'conditioning'; its inferences are concer-ned with information about G given the information in p. Thus the forcing relation must allow for further information which may become available 'later', so to speak.
As a first pass, here is a brief glimpse of the character of the forcing relation: as this is a syntactical relation, we refer to a language whose terms are built from functions from P to M, and so we have (see [Kun2,Cor. 3.7]): A clearer picture will emerge shortly. Whilst a variant of the forcing relation above was Cohen's starting point, this is now a derived concept, the usual starting point being a set G that is a filter on P with the property that whenever D is a dense subset of P (i.e. for each p there is q p with q ∈ D) and D ∈ M, then Then G is said to be P -generic over M, or just generic over M, when P is understood.
For M countable, the dense subsets of P lying in M may be enumerated as a sequence D n , and we may choose p n ∈ P starting with an arbitrary p 0 ∈ D 0 and inductively p n+1 p n with The choice is possible precisely because D n+1 is dense. Then G := {q : (∃n) q p n } meets each D n , and so is generic over M. This construction is sometimes called the Cohen diagonalization argument, since, in particular, G decides every sentence ϕ. Indeed, the following set is dense: ∈ D ϕ implies not(p ¬ϕ) and so (∃q p) [q ϕ]). The idea is that the dense sets provide a structured way of hinting at the properties of G and about the various ways that G might be selected, but conditional on some given state of knowledge p. The sequence p n above runs through all possible dense sets in an arbitrary order, and brings into existence a particular realization of G.
Before G is created there are only names for G and for all the possible objects in the intended extension, given simply by the functions in M P . (This corresponds to the use of polynomials in field extension.) But, once a generic G is given, one may proceed inductively to give an interpretation τ G to the 'names' τ ∈ M P of objects, inductively so that (mirroring the Mostowski collapse above), and so construct the extension M[G] as the set of G-interpretations. One then defines forcing (relative to P and M) by: This should clarify the three properties of the forcing relation introduced earlier.
It emerges that if M |= ZFC, then M[G] |= ZFC. Furthermore, if P satisfies the so-called countable chain condition ('ccc' ) (which actually calls for antichains of P in M to be countable), then all ordinals that are cardinals from the viewpoint of M continue to be cardinals from the viewpoint of M [G], and their cofinalities [Jec2] remain the same.
To secure the failure of CH, Cohen used as his conditions finite sets p with elements of the form: n, α, i for n ∈ ω, α < ω 2 , i ∈ {0, 1}, which act as coded messages about objects, named as c α , to be imported from outside M asserting that n / ∈ c α if i = 0 and n ∈ c α if i = 1. As with the 'dog that did not bark', that which p will never say allows us to infer that c α will be a subset of ω : this is forced to be the case, since no extension of the coded message p can say otherwise. Thus p 'hints at information' by the absence of information.
Formally, the corresponding P, called Add(ω, ω 2 ) since it adds ω 2 many subsets of ω, may be defined in M to comprise 'partial functions' p with finite domain contained in ω × ω M 2 and range in {0, 1}, and with the ordering of 'increasing informativeness' that q p if p ⊆ q, that is, q contains at least all of the information in p. The filter G in P has the property that G = { n, α, i(n, α) : n ∈ ω, α ∈ M ∩ ω M 2 } for some i : (n, α) → {0, 1}. Indeed, for n, α as above, each of the sets D n,α := {p : n, α, i ∈ p for some i ∈ {0, 1}} is dense, as may be readily checked. (Hint: Given p / ∈ D n,α choose q to contain both p and n, α, 1 .) So G must meet D α,n for each α ∈ M (as ω ⊆ M, since Moreover, for distinct α, β < ω 2 , put ∆ α,β := {p : n, α, i , n, β, 1 − i ∈ p for some n ∈ ω and some i ∈ {0, 1}}, which is dense. (Given p / ∈ ∆ α,β choose q to contain both p and m, α, 1 , m, β, 0 for large enough m.) So for distinct α, β ∈ M∩ω M 2 , G contains n, α, i , n, β, 1− i for some n and i, with i = 1, say (w.l.o.g.). Then n ∈ G α \G β . Thus in M [G] there are ω M 2 distinct subsets of ω, and so from the viewpoint of M[G] the continuum is at least ω 2 (since ω M 2 is still the interpretation of ω 2 in M[G] by the ccc, which is satisfied by P here).
We have just given an example of importing a set in order to increase the cardinality of the continuum. (Note that this construction may be repeated with ω M 2 replaced by ω M τ for τ with any cofinality other than ω, that being the only restriction on the cofinality of the continuum.) An important ingredient in Solovay's result [Sol3] on LM (in constructing a model of ZF+DC in which all sets of reals are Lebesgue measurable -cf. [Kan, Ch.13 §11] -to which we refer in §10.2) uses a further partial order P κ = Coll(ω × κ, κ), introduced by Lévy, whose function is to alter/collapse a (strongly) inaccessible cardinal κ so that in the extension N = M[G κ ] (G κ being P κ -generic over M) it is the ordinal κ that appears as the first uncountable cardinal ω N 1 . Consequently the ordinals below κ are made to be countable by the importation of appropriate enumerations. Interest focuses on the substructure N 1 with domain the sets that are hereditarily definable over N , from a parameter in N ∩On ω (i.e. from a sequence of ordinals in N ), much as defined earlier. N 1 satisfies the axioms ZF (see [MyhS]), and, significantly here, shares the same sequences of ordinals, in particular the same reals. (Here the reals are identified via binary expansion with characteristic functions of subsets of ω.) The Lévy conditions (elements of P κ ) this time are partial functions with finite domain ω × κ and range in κ. Since there are no bounds placed on the range values of the partial function in this P , it follows that for α < κ the functions G α := { n, λ(α, n) : α, n, λ(α, n) ∈ G κ } will collectively witness (by enumeration) that each λ < κ is countable. This ensures that κ "viewed from" M[G κ ] is ω 1 . Solovay 's purpose is to turn any transfinite sequence of ordinals below an inaccessible κ into an ω-sequence. This helps him turn an arbitrary set of reals A that lies in N 1 , initially definable in N via ordinal parameters, into one that is definable via a real a. (This also carries the advantage that, since κ retains its inaccessibility in the extension M[a], one may w.l.o.g. argue as though M[a] is M.) As both N and N 1 have the same reals, they also have the same Borel sets and the same null G δ -sets. Solovay's surprising innovation was to force over M[a] using the non-null Borel sets B + ordered by inclusion (smaller sets yielding more information as to location). The key idea here is to introduce the notion of a random real, namely a real that cannot be covered by any null G δ -set coded canonically by a real c of the model M [a]. (Solovay thought of these as 'random'; we have already mentioned that Cohen reals are categorical, while random ('Solovay') reals are measure-theoretic; the term generic was already in use, so unavailable. Compare our earlier use of the language of probability and statistical inference above. One might also mention the term pseudo-random number in computer simulation.) But, M[a] being countable, there are only countably many such codes, so in V the set of non-random reals is null. For a set A ⊆ ω ω that is definable from an ω-sequence of ordinals (i.e., by a sequence from On ω ), suppose that with a as above, for some formula ϕ A say, x]}. Now one may choose a formula ψ A such that, for G + a B + -generic filter and any x ∈ M[G + ] ∩ On ω , In B + choose a maximal (necessarily countable, by positivity of measure here) antichain of Borel sets C whose elements 'decide' the formula ψ A [ǎ,ṙ] (i.e. force the formula or its negation), whereǎ is a name for the set a given above, andṙ is a name for a random real (cf. the use ofq in §6b below). Then for x random: Here F c is a non-null closed set canonically coded by c. So modulo the null set of non-random reals, A is an F σ .

6b. Forcing Axioms Solovay's argument makes heavy use in various ways of 'two-step extensions' like M[G][H] with G an M-generic filter and H an M[G]-generic
filter. By implication, G is associated with a partial order P in M and H with a partial order Q in M [G]. This can be turned into a one-step extension M [K], but in a perspicuous way (more general than cartesian products), so that a generic extension of a generic extension is again a generic extension. Since the model M[G] is created by interpreting 'names' (using G as in τ G above), the partial order for the equivalent single step needs to be built out of P and out of a nameQ for Q, and must refer to pairs (p,q) with p ∈ P andq a name for something that is P -forced to lie inQ; likewise, the order on the resulting composition of the two partial orders, denoted P 1 * Q, must make use of how the P -conditions P -force the extension propertyq q ′ between names for elements of M[G] [H]. Thus a kind of syntactical analysis in M underlies this 'iterated forcing'. More generally, any ordinal α of M can provide the basis for α-step iterations, and, as with the topologies on products so too here, various kinds of α-iterations may be constructed by appropriate constraints on the supports (e.g. finite or countable). We omit the details, except to mention that it was by use of such an iteration that Solovay and Tennenbaum [SolT] showed that it is consistent that no Suslin continuum exists (so otherwise than in L, where such exists); this led to the more general observation, proved by Martin and Solovay: the consistency of Martin's Axiom, MA ( [MarS], cf. [Fre1]), namely the statement that for all cardinals κ below the continuum (κ < c) the following holds: MA(κ) : for every partial order P satisfying the countable chain condition (ccc), and any family F with |F | κ of dense subsets of P, there is a filter G in P which meets each D ∈ F . The reader will notice the similarity between the property of G here and that of a filter P -generic over M; indeed Martin (and independently Rowbottom) proposed this axiom as a combinatorial principle that is forcingfree -so, in particular, with the potential for immediate applicability without expertise in logic. That potential was so quickly realized both in theoremproving and counterexample-manufacture -look no further than [Fre1] that it became the 'tool of first choice' when abstaining from CH whilst harbouring CH-like intuitions, because, like Zorn's Lemma, it encapsulates a 'construction without (transfinite) induction', replacing the latter with a side-condition swept away into F , the family of dense sets. Of course, the 'implied' induction was performed, off-line so to speak, in the Martin-Solovay paper [MarS], aptly titled 'Internal Cohen extensions', reflecting the view that MA asserts that the universe of sets is closed under a large class of generic extensions.
In regard to MA's huge significance as an alternative to the continuum hypothesis: we cite after Martin and Solovay [MarS] the statistic that at least 71 of 82 consequences of CH, as given in Sierpiński's monograph [Sie], are decided by MA or [MA & 2 ℵ 0 > ℵ 1 ]. Amongst these are that MA implies: (1) 2 ℵ 0 is not a real-valued measurable cardinal; (2) the union of less than 2 ℵ 0 (Lebesgue) null /meagre sets of reals is null/meagre; (3) Lebesgue measure is 2 ℵ 0 -additive; and that [MA & 2 ℵ 0 > ℵ 1 ] implies: (1) Suslin's hypothesis, that every complete, dense, linear order without first and last elements in which every family of disjoint intervals is at most countable (the Suslin condition) is order-isomorphic to R; (2) every Σ 1 2 set of reals (for the Σ and Π notation of the projective hierarchy see §9) is Lebesgue measurable and has the Baire property; (3) every set of reals of cardinality ℵ 1 is Π 1 1 (co-analytic) iff every ℵ 1 union of Borel sets is Σ 1 2 . It is worth remarking that an equivalent of MA is the topological statement that, in a compact Hausdorff space whose open sets satisfy the countable chain condition, the union of less than 2 ℵ 0 meagre sets is meagre [Wei], [Fre1]. This identifies MA as a variant of Baire's Theorem, and gives it a special role in the investigation of the additivity properties etc. of classical ideals such as the null and meagre sets, for which see [BartJ].
Given its particular usefulness and origin, MA, termed a Forcing Axiom, inspired the search for further, more powerful, forcing axioms. The first to occupy centre-stage is the Proper Forcing Axiom, PFA. This is an extension of MA(ℵ 1 ), which draws in more model theory. At the price of replacing all the cardinals κ < c by allowing just κ = ℵ 1 , PFA relaxes the 'ccc' restriction. (In fact, Todorčević and Veličković ([Tod], [Vel]) showed that PFA implies that c = ℵ 2 , so allowing back in all the, rather few, cardinals κ < c.) The relaxation widens access to the class of proper partial orders (below), and so asserts: PFA: for every partial order P that is proper and any family F with |F | ℵ 1 of dense subsets of P, there is a filter G in P which meets each D ∈ F .
The definition of properness refers to the interplay between the whole of the partial order P and those fragments of P that appear in 'suitably rich' countable structures, as follows. A partial order P is proper if, for any regular uncountable cardinal κ and countable model M ≺ H(κ) (the family of sets hereditarily of cardinal less than κ [Dra, Ch. 3 §7]) with P ∈ M : for each p ∈ P ∩ M and each q p, every antichain A ∈ M contains an element r compatible with p.
(This formulation obviates the need to refer to 'maximal antichains'.) The class of proper partial orders includes both those satisfying ccc (which preserves cardinality, and cofinality) and those with countable closure (i.e. guaranteeing a lower bound for any decreasing ω-sequence). A consistency proof for PFA needs use of a supercompact cardinal. See [Bau] for applications and discussion (especially remarks after his Th. 3.1 concerning the need for a supercompact and its 'reflection properties'), and also [Dev2], and the more recent [Moo]. A wider variant still is SPFA, based on ℵ 1 -semiproper forcing. The maximal version, known as Martin's Maximum, MM, was introduced by Foreman, Magidor and Shelah [ForMS], and like PFA needs a supercompact cardinal for a proof of its consistency. Here the role of ω 1 as ℵ 1 (in merely prescribing a cardinality bound) changes in order to create an ω 2 -chain condition, as we shall see presently. Prominence is given now to the stationary subsets of ω 1 (defined below), cf. §5b; these are the 'non-negligible' subsets in relation to coding, and their definition draws on some associated 'large' sets: the subsets that are closed and unbounded (cofinal) in ω 1 , with which we begin. A set C ⊆ ω 1 is closed if it contains all its limit points (i.e. sup(C ∩ α) ∈ C for limit α whenever C ∩ α is cofinal in α); such sets form a filter, as any two unbounded closed sets meet. A subset S ⊆ ω 1 is stationary if S meets every closed unbounded set. In MM, the partial orders P are required to preserve stationarity. This condition is motivated by a question about the non-stationary ideal, the ideal of non-stationary sets (denoted ℓ NS or NS ω 1 ): whether it is ω 2 -saturated, i.e. whether every ω 2 -sequence of stationary sets contains at least two members intersecting again in a stationary set. If so, then the Boolean algebra ℘(ω 1 )/ℓ NS is complete and satisfies the ω 2 -chain condition. MM implies this.
Woodin [Woo1,2] has forcefully argued for a canonical model where CH fails (cf. Coda); it is a forcing extension of L(R), i.e. of the Hajnal 'constructible closure' of R (the class of sets constructible from some real in V -[Dra, Ch. 5 §6.1], cf. [Kan,Ch. 1,§3]; this is not to be confused with the Lévy class of sets 'constructible relative to a given set' [Dra,Ch. 5 §6.2], which occurs in §5 in the shape of L[U] with distinct notation).

Suslin, Luzin, Sierpiński and their legacy: infinite games and large cardinals
After the (necessarily) extensive excursion into logic and model theory, we now re-anchor all this to analytic practice. Henceforth, we intertwine these two aspects. For the Analysts's point of view of set theory, we can do no better at this point than to cite C. A. (Ambrose) Rogers, a modern-day analyst par excellence (with a pedigree of: Geometry of Numbers, Discrete geometry, Convexity, Hausdorff measures, Topological descriptive set theory). In his last phase (post 1960), Rogers famously 'would often give talks entitled "Which sets do we need?", his answer being: analytic sets' (cited from [Ost7]). To these we now turn. For background here, see [Rog].

7a. Analytic sets
Analytic subsets of R are precisely the sets that arise as projections of planar Borel sets. Their initial ('classical') study, principally by Suslin, Luzin and Sierpiński, was prompted by Lebesgue's erroneous assertion, in the course of his research on functions that are 'analytically representable', that these projections were Borel. But they need not be, as was first observed by Suslin in 1916. Indeed, an analytic set is Borel iff its complement is also Borel [Sou]. Until that moment the typical sets considered by analysts were Borel. Fortunately for Lebesgue's research goals, analytic sets are extremely wellbehaved: in the first place projections of analytic sets are inevitably analytic, and furthermore they have the following three regularity properties ('the classical regularity properties' below): they are measurable [Lus], they have the property of Baire [Nik], and likewise the perfect-set property [Ale] (they are either countable or contain a perfect set), and in certain circumstances are well approximable from within by compact subsets (they are 'capacitable' -a property discovered independently by R. O. Davies [Dav] in 1952 and in a general topological context by G. Choquet in 1952 [Cho1-4]).
The newly discovered sets emerged as the first-level sets of the projective hierarchy (also called the Luzin hierarchy) generated from the Borel sets by alternately applying the operation of projection and complementation (a fact later recognized also through the analysis of their logical complexity: counting how many alternations of existential and universal quantifiers over the reals are needed to define them, and identifying which the preliminary quantifier is: existential or universal). However, the very successful classical study of analytic sets struggled to promote much of the 'good behaviour' up the hierarchy. At the margins, of particular interest, was Kôndo's uniformization theorem of 1939 (that a co-analytic planar set has a co-analytic uniformization, i.e. contains a co-analytic graph selecting one point from each vertical section).
The message from set theory in Gödel's inner universe of sets L was particularly depressing: Kôndo's theorem implied the existence in L of an analytic sets whose complement failed to have the perfect-set property (the culprit was the well-ordering of L, which relative to L lies at the second projective level).
Further progress seemed doomed. But an unlikely development, in the shape of a game-theoretic rival to AC, unblocked the log-jam. However, it was left to a later generation to pore over the classical achievements to extract the necessary inspiration from the classicists by drawing in a further theme: the Banach-Mazur games.
To explain this development we need to explore some analytic-set theory. Suslin's characterization [Sou] in 1917 of analytic sets S ⊆ R asserts they may be represented in the form where each of the determining sets F (i|n) is closed and of diameter at most 2 −n -so that F (i) has at most one member; here i|n := (i 0 , ..., i n−1 ).
(For this reason, the operation taking a determining system to the set S above is now usually called the Suslin operation, though it is sometimes called the A-operation as in [Kur], apparently named for P. S. Alexandrov, who had devised it to construct perfect subsets of uncountable Borel sets [Ale].) Implicit in the formula is an operation on the determining system of sets F (i|n) : i|n ∈ N <N , which includes countable intersection and countable union (and preserves analyticity if the determining system comprises analytic sets [Rog,Part 1,§2.3]). This goes beyond countable union seemingly towards a continuum union, but one that is constrained by the upper (h)semi-continuity of the map i →F (i).
Under this 'continuous union' lie hidden the countable ordinals, by virtue of the countable tree T of all finite sequences i|n (ordered by sequence extension). For any x the associated subtree ∈ S, as then T x has no paths (infinite branches); indeed x / ∈ F (i) for all i. (This tree idea, with the i|n replaced by rationals, goes back, albeit under the name 'sieve', to Lebesgue's construction of a measurable set that is not Borel.) The overall complexity of the subtree may then be measured by a countable ordinal, known as the Luzin-Sierpiński index of the tree T x (or of the point x) - [LusS]. This is obtained rather as the Cantor-Bendixon index of a scattered set is obtained by the repeated (inductive) removal of isolated points, except that here one removes at each stage the terminal nodes of a tree. (A moment's reflection shows this corresponds to a linear ordering of the finite sequences, akin to lexicographic but adjusted to allow shorter sequences to preceed their longer extensions, such that the tree is well-ordered iff it is well-founded: this is the Kleene-Brouwer order.) When the determining system of S (i.e. the family of sets F (i|n) above) consists of closed sets, it readily follows, via its countable transfinite definition, that the set of points x in the complement of S with index bounded by α < ω 1 is Borel. It is also immediate that the complement of an analytic set is a union of ω 1 Borel sets, since the index is bounded by ω 1 . The important boundedness property of the index (that it remains bounded over any analytic set S ′ in the complement of S by a corresponding countable ordinal, a matter that hinges on the 'continuous union' aspect) leads to a proof of the First Separation Theorem: disjoint analytic sets may be covered by disjoint Borel sets. From here, as an immediate corollary, an analytic set with analytic complement is Borel.

7b. Banach-Mazur games and the Luzin hierarchy
We recall that a Banach-Mazur game with target set S ⊆ R is an infinite positional game which may be viewed as played by two players 'alternately picking ad infinitum' the digits of a decimal expansion of a real number -but this needs the interpretation that each player selects a function (a strategy) determining that player's choice of next digit, given the current positionwith the first player declared the winner iff the real number generated from the play of the two strategies falls in S, and otherwise the second. The target set S is said to be determined if one or other of the players has a winning strategy. Mazur proposed the game (this is Problem 43 in the Scottish Book, [Mau]), and Banach responded in 1935 by characterizing determinacy by the property of Baire. See [GalMS] for an alternative infinite game which offers a measure-theoretic result as a contrast to Banach's category result.
It is clear from its description that the game offers a natural interpretation for a sequence of choices in a manner related to the countable axiom of choice.
In 1962 Mycielski and Steinhaus [MycS] proposed the Axiom of Determinacy, AD, as an alternative to AC -in essence setting the task of ascertaining its consistency relative to ZF. See [Myc] for an account of the consequences of AD current in 1964, making the case that, in a hoped-for subuniverse of sets in which AD holds, the well-known 'paradoxes' (Hausdorff, Banach-Tarski, ...) flowing from AC would be ruled out, while at the same time preserving standard analysis in R (since 'countable choice' for a countable family with union at most a continuum of members follows from AD -so, in view of the continuum restriction, it is usual to work with AD+DC). We may pass now to a generalization of Suslin's representation for analytic sets, which enabled higher-level analogues of the classical regularity properties. Interpreting N N as the set of irrationals (via continued fraction expansion), we may w.l.o.g. assume that S ⊆ N N . This carries the simplifying advantage that, ignoring a countable set of lines, we may easily identify planar sets, regarded as lying in N N × N N , with subsets of N N (merging a pair (x, y) into a single sequence x, y ) and so regard projection as an operation from N N to N N .
Replacing F (i|n) by its 2 −n open swelling S(i|n) yields that s ∈ S iff for some i ∈ N N s|n ∈ S(i|n) (n ∈ N); here we interpret s|n as a (rational) point of R (and implicitly refer to the metric of first difference: d(x, y) = 2 −n , when x, y differ first in their n th term). We can tidy up further while working in R, by assuming compact F (i|n) and replacing S(i|n) with a union of a finite number of rational-ended closed intervals. Coding such finite unions by N, we arrive at a reformulation of Suslin's characterization: for T a tree of finite (pairs (u, v) of ) sequences, define the projection of T into N N by then S is analytic iff S = p(T ) for some appropriate tree T of finite sequences of elements of N × N. The generalization to a γ-Suslin set for ordinals γ is obtained by taking trees T of finite sequences of elements from N × γ, and provides the context allowing the regularity properties of category and measure to be lifted up the projective hierarchy. A γ-Suslin set is said to be a homogeneously Suslin set if there is an ω 1 -complete ultrafilter U x|n for each x|n such that for all n {i|n ∈ γ n : (x|n, i|n) ∈ T } ∈ U x|n (membership witnessed via a 'large' set of nodes), and (projection equivalent to passage through a 'large' sets of nodes at each height/level; the sequence U x|n : n ∈ N is then said to be countably complete). In using the index set γ <ω these generalizations sound muted echoes of the non-separable theory of analytic sets (pioneered by A. H. Stone and R. W. Hansell -see [Sto] and [Ost3]). Martin, generalizing [Mar], shows in [MarSt,Th. 2.3] that homogeneously γ-Suslin sets are determined (as well as having the classical regularity properties), and that if Ramsey cardinals exist, then co-analytic sets are homogenously Souslin. This last result is a re-interpretation of Martin's earlier theorem [Mar] that if there is a Ramsey cardinal (e.g. if there is a measurable cardinal), then analytic games are determined.
Two features of the analysis of a co-analytic set C via the Luzin-Sierpiński index are of great significance to the study of projective sets. First, the index maps to the ordinals, i.e. into a well-ordered set, and so the index induces a prewellordering, rather than a well-ordering on the set C (as distinct points of C may be mapped to the same ordinal). Secondly, denoting the index by ρ, the relation R + (x, y) := x ∈ C and ρ(x) ρ(y), and its negation R − (x, y) are both Borel, and so both co-analytic. Taking an abstract viewpoint, a class Γ of sets in N N may be said to have the prewellordering property if for every set C ∈ Γ there is a map ρ : C → On such that both of R ± (x, y) are in Γ. (The map is then called a Γ-norm.) Suppose that the complementary classΓ (i.e. of sets with complement in Γ) is, like the analytic sets, closed under projection; then the class of sets ∃ 1 Γ obtained as the projections of sets in Γ also has the prewellordering property. This would have been clear to Luzin and Sierpiński; but, with the introduction of determinacy, a new feature arises: The First Periodicity Theorem ( [Mar], [Mos2]): For a class of sets Γ for which the sets in the ambiguous class ∆ Γ := Γ ∩Γ are determined: for every C ∈ Γ, if C admits a Γ-norm, then {y : ∀x[ x, y ∈ C]} admits a norm in the class of sets ∀ 1 ∃ 1 Γ, i.e. in the class of sets of the form ∀x∃y[ x, y ∈ C ′ ] for some C ′ in Γ.
Thus, in particular: inductively, if the Σ 1 2n -class (for the Σ and Π notation of the projective hierarchy, again see §9) has the prewellordering property, then so does the Π 1 2n+1 -class, assuming determinacy of the ambiguous class ∆ 1 2n . The Π 1 2n+1 -class yields quite directly a prewellordering for the class with norm ρ C , then a norm (of the corresponding class) for A may be defined by Thus the prewellordering property 'zig-zags' between the Π and Σ classes.
Part of the motivation to take a game-theoretic approach to the projective sets was the appearance in 1967 of a new proof of the earlier mentioned Suslin separation theorem for analytic sets given by David Blackwell [Blac] on the basis of the Gale-Stewart proof of the determinacy of open sets [GalS] of 1953. The wealth of insights thereafter is history: witness the very title of Mathias's 'Surrealist landscape with figures' survey [Mat], capturing the spirit of the time.
It was a careful reading of Kôndo's proof of the uniformization of Π 1 1sets by a Π 1 1 graph that initially led Moschovakis to isolate a more general kind of Γ-norm: that of a Γ-scale which refers to an ω-sequence of Γ-norms ρ m defined on a set C of Γ with associated relations R ± (m, x, y) in Γ (as with the single Γ-norm above), but with an additional 'convergence-guiding' property: for any sequence c n ∈ C with c n → c 0 , if for each m ρ m (c n ) : n ∈ ω is eventually a constant, λ m say, then c 0 ∈ C and ρ m (c 0 ) λ m for all m. (See e.g. [MarK,§8.2].) Mutatis mutandis, the Moschovakis Second Periodicity Theorem [Mos2] has the same form as the First but with Γ-scale replacing Γ-norm throughout. Analogously, the Second Theorem implies that the Kôndo uniformization property likewise zigzags between the Π and Σ classes -see [Mos1].
Guided by the original Π 1 1 -norm (the Luzin-Sierpiński index), having range in ω 1 (less, if the Π 1 1 set in question is Borel), one defines the projective ordinal of level n by reference to the sets in the ambiguous class ∆ 1 n δ 1 n := supremum of the lengths of prewellorderings in ∆ 1 n .
Martin showed that δ 1 2 ω 2 , with equality implied under AD by the Moschovakis result that δ 1 n for n 1 is a cardinal and that, under PD, δ 1 2n < δ 1 2n+2 . Under AD+DC δ 1 2n = (δ 1 2n−1 ) + (i.e. the even-indexed ordinal is the successor of the preceding odd-indexed one); furthermore, Jackson's theorem [Jac1,2] asserts that under AD+DC A concerted effort to assess the consistency strength of the determinacy assumption for ∆ 1 n ultimately led to the result that this is equiconsistent with the existence of n Woodin cardinals below a measurable cardinal.

Shadows
Here we wrap up our survey of the set-theoretical domain. We have seen how combinatorial properties, some 'high up', in Cantor's world affect properties of the real line down below. When powerful axioms extend familiar properties in desirable ways one is led to ask whether one can get away with less and get if not the same outcome, then 'almost' the same (in some sense). To this end Mycielski and Tomkowicz [MycT] speak in very suggestive language of shadows of AC in their chosen setting of L(R), a model of set theory that resolves some of the hardest set-theory problems. Their quest is theorems of ZFC that have corollaries that are theorems of ZF+AD -see [MycT]. In L(R) AD implies DC [Kec1], and the present authors have come to view DC as a natural ally for analysis. We give our favourite example of this, and then, after a brief review of syntactical teminology in §9, we survey in §10 results which give further succour, if one is willing in the interests of plurality to conduct mathematics in an appropriate helpful (indeed playful, to borrow the term from [Mos1], when games are enlisted) subuniverse.
An example with the Principle of Dependent Choice DC in mind. We begin with an example concerned with real-valued sublinear functions on R which 'almost' follow Banach's enduring paradigmatic definition. They are subadditive, i.e. satisfying f (x + y) f (x) + f (y), but in one variant they are N-homogeneous in the sense that f (nx) = nf (x) for n = 0, 1, 2, ..., so Q + -homogeneous, and for all x. In other variants the quantification over x may also be thinned -see [BinO6]. In electing to study sublinear functions as possible realizations of norms, Berz ([Berz], [BinO6]) showed, for measurable f, that the graph of f is conical -comprises two half lines through the origin; however, his argument relied on AC, in the usual form of Zorn's Lemma, which he used in the context of R over the field of scalars Q. In spirit he follows Hamel's construction of a discontinuous additive function, and so ultimately this rests on transfinite induction of continuum length requiring continuum many selections. Our own proof [BinO6] (cf. [BinO7,10]) of Berz's theorem, taken in a wider context including Banach spaces, depends in effect on the Baire Category Theorem BC, or the completeness of R (in either of the distinct roles of 'Cauchy-sequential' and 'Cauchy-filter' completeness, the latter stronger in the absence of AC, see [FosM,§3] and also [DodM,§7,§2]): we rely on generalizations of the Kestelman-Borwein-Ditor Theorem, KBD, asserting that for any (category/measure theoretic) non-negligible set T and any null sequence z n → 0, for quasi all t ∈ T the t-translate of some subsequence z n(m) (dependent on t) embeds in T, i.e. t+z n(m) ∈ T. See [MilO] for a discussion of this 'shift-compactness' notion. KBD is a variant of BC. So the proof ultimately rests on elementary induction via the Axiom (Principle) of Dependent Choice(s) DC (thus named in 1948 by Tarski [Tar2,p. 96] and studied in [Most], but anticipated in 1942 by Bernays [Ber,Axiom IV*,p. 86] -see [Jec1,§8.1], [Jec2,Ch. 5]); DC in turn is equivalent to BC by a result of Blair [Bla]. (For further results in this direction see also [Pin3,4], [Gol], [HerK], [Wol], and the textbook [Her].) The relevance of KBD in the setting of a Polish group comes from its various corollaries which include the Steinhaus-Weil Interior points Theorem [BinO9], the Open Mapping Theorem and its generalization to group actions: the Effros Theorem -see [vMil], [Ost4,5,6]. For a target set T that is a dense G δ , embeddings which are performed simultaneously in any neighbourhood by a perfect subset of T of a fixed set Z (not necessarily a null sequence) into T characterize those sets Z that are strong measure zero -see [GalMS].
We note that DC is equivalent to a statement about trees: a pruned tree has an infinite branch (for which see [Kec2,20.B]) and so by its very nature is an ingredient in set-theory axiom systems which consider the extent to which Banach-Mazur-type games (with underlying tree structure) are determined. The latter in turn have been viewed as generalizations of Baire's Theorem ever since Choquet [Cho5] -cf. [Kec2,8C,D,E]. Inevitably, determinacy and the study of the relationship between category and measure go hand in hand.

The syntax of Analysis: Category/measure regularity versus practicality
The Baire/measurable property discussed at various points above is usu-ally satisfied in mathematical practice. Indeed, any analytic subset of R possesses these properties ([Rog, Part 1 §2.9], [Kec2,29.5]), hence so do all the sets in the σ-algebra that they generate (the C-sets, [Kec2,§29.D], C for criblé -see [Bur1,2], cf. [BinO4]). There is a broader class still. Recall first that an analytic set may be viewed as a projection of a planar Borel set P, so is definable as {x : Φ(x)} via the Σ 1 1 formula Φ(x) := (∃y ∈ R)[(x, y) ∈ P ]; here the notation Σ 1 1 indicates one quantifier block (the subscripted value) of existential quantification, ranging over reals (type 1 objects -the superscripted value). Use of the bold-face version of the symbol indicates the need to refer to arbitrary coding (by reals not necessarily in an effective manner, for which see [Gao,§1.5 is provable in ZF, i.e. without reference to AC, then A is said to be provably ∆ 1 2 . It turns out that such sets have the Baire/measurable property -see [FenN], where these are generalized to the universally (=absolutely) measurable sets (cf. [BinO6,§2]); the idea is ascribed to Solovay in [Kan,Ch. 3 Ex. 14.4]. How much further this may go depends on what axioms of set theory are admitted, a matter to which we now turn.
Our interest in such matters derives from the Character Theorems of regular variation, noted in [BinO3,§3] (revisited in [BinO5,§11]), which identify the logical complexity of the function which is ∆ 1 2 if the function h is Borel (and is Π 1 2 if h is analytic, and Π 1 3 if h is co-analytic). We argued in [BinO3,§5] that ∆ 1 2 is a natural setting in which to study regular variation.

Category-Measure duality
1. Practical axiomatic alternatives: LM, PB, AD, PD. While ZF is common ground in mathematics, AC is not, and alternatives to it are widely used, in which for example all sets are Lebesgue-measurable (usually abbreviated to LM) and all sets have the Baire property, sometimes abbreviated to PB (as distinct from BP to indicate individual 'possession of the Baire property'). One such is DC above. As Solovay [Sol3,p. 25] points out, this axiom is sufficient for the establishment of Lebesgue measure, i.e. including its translation invariance and countable additivity ("...positive results ... of measure theory..."), and may be assumed together with LM. Another is the Axiom of Determinacy AD mentioned above and introduced by Mycielski and Steinhaus [MycS]; this implies LM, for which see [MycSw], and PB, the latter a result, mentioned in §7, due to Banach -see [Kec2,38.B]. Its introduction inspired remarkable and still current developments in set theory concerned with determinacy of 'definable' sets of reals (see [ForK] and particularly [Nee]) and consequent combinatorial properties (such as partition relations) of the alephs (see [Kle]); again see §7. Others include the (weaker) Axiom of Projective Determinacy PD [Kec2,§ 38.B], cf. §7, restricting the operation of AD to the smaller class of projective sets. (The independence and consistency of DC versus AD was established respectively in Solovay [Sol4] and Kechris [Kec2] -see also [KecS]; cf. [DalW1], [Ost2].) 2. LM versus PB. In 1983 Raissonier and Stern [RaiS,Th. 2] (cf. [Bart1,2]), inspired by then current work of Shelah (circulating in manuscript since 1980) and earlier work of Solovay, showed that if every Σ 1 2 set is Lebesgue measurable, then every Σ 1 2 set has BP, whereas the converse fails -for the latter see [Ster] -cf. [BartJ,§9.3] and [Paw]. This demonstrates that measurability is in fact the stronger notion -see [JudSh,§1] for a discussion of the consistency of analogues at level 3 and beyond -which is one reason why we regard category rather than measure as primary. For we have seen above how the category version of Berz's theorem implies its measure version; see also [BinO6,10].
Note that the assumption of Gödel's Axiom of Constructibility V = L, a strengthening of AC, yields ∆ 1 2 non-measurable subsets, so that the Fenstad-Normann result on the narrower class of provably ∆ 1 2 sets mentioned in §9 above marks the limit of such results in a purely ZF framework (at level 2). 3. Consistency and the role of large cardinals. While LM and PB are inconsistent with AC, such axioms can be consistent with DC. Justification with scant exception involves some form of large-cardinal assumption, which in turn, as in §4, calibrates relative consistency strengths -see [Kan] and [Ko-eW] (cf. [Lar] and [KanM]). Thus Solovay [Sol3] in 1970 was the first to show the equiconsistency of ZF+DC+LM+PB with that of ZFC+'there exists an inaccessible cardinal '. The appearance of the inaccessible in this result is not altogether incongruous, given its emergence in results (from 1930 onwards) due to Banach [Ban] (under GCH), Ulam [Ula] (under AC), and Tarski [Tar1], concerning the cardinalities of sets supporting a countably additive/finitely additive [0,1]-valued/{0, 1}-valued measure (cf. [Bog,1.12(x)], [Fre2]). Later in 1984 Shelah [She1,5.1] showed in ZF+DC that already the measurability of all Σ 3 1 sets implies that ℵ L 1 is inaccessible (the symbol ℵ L 1 refers to the substructure/ subuniverse of constructible sets and denotes the first uncountable ordinal therein -cf. §2). As a consequence, Shelah [She1,5.1A] showed that ZF+DC+LM is equiconsistent with ZF+'there exists an inaccessible', whereas [She1,7.17] ZF+DC+PB is equiconsistent with just ZFC (i.e. without reference to inaccessible cardinals), so driving another wedge between classical measure-category symmetries (see [JudSh] for further, related 'wedges'). The latter consistency theorem relies on the result [She1,7.16] that any model of ZFC + CH has a generic (forcing) extension satisfying ZF+ 'every set of reals (first-order) defined using a real and an ordinal parameter has BP'. (Here 'first-order' restricts the range of any quantifiers.) For a topological proof see Stern [Ster]. 4. LM versus PB continued. Raisonnier [Rai,Th. 5] (cf. [She1,5.1B]) has shown that in ZF+DC one can prove that if there is an uncountable wellordered set of reals (in particular a subset of cardinality ℵ 1 ), then there is a non-measurable set of reals. (This motivates Judah and Spinas [JudSp] to consider generalizations including the consistency of the ω 1 -variant of DC.) See also Judah and Rosłanowski [JudR] for a model (due to Shelah) in which ZF+DC+LM+¬PB holds, and also [She2] where an inaccessible cardinal is used to show consistency of ZF+LM+¬PB+'there is an uncountable set without a perfect subset'. For a textbook treatment of much of this material see again [BartJ].
Raisonnier [Rai,Th. 3] notes the result, due to Shelah and Stern, that there is a model for ZF+DC+PB+ℵ 1 = ℵ L 1 + 'the ordinally definable subsets of reals are measurable'. So, in particular by Raisonnier's result, there is a non-measurable set in this model. Shelah's result indicates that the nonmeasurable is either Σ 1 3 (light-face symbol: all open sets coded effectively) or Σ 1 2 (bold-face). Thus here PB+¬LM holds. 5. Regularity of reasonably definable sets. From the existence of suitably large cardinals flows a most remarkable result due to Shelah and Woodin [SheW] justifying the opening practical remark about BP, which is that every 'reasonably definable' set of reals is Lebesgue measurable: compare the commentary in [BecK] following their Th 5.3.2. This is a latter-day sweeping generalization of a theorem due to Solovay (cf. [Sol2]) that, subject to large-cardinal assumptions, Σ 1 2 sets are measurable (and so also have BP by [RaiS]).

Coda
To return to the algebraic characterization of the reals as 'the' complete archimedean ordered field: it is the 'complete' which hides the 'modulo cardinality' and 'modulo which sets are available' aspects. It is always good to look at familiar mathematics, and ask oneself the analogous question in that context.
As working analysts ourselves, we feel for those of our colleagues new to these matters, who may look fondly back to an age of 'bygone innocence', when 'one didn't need to worry about such things'. We prefer instead to marvel at the unfathomable richness of mathematics. As usual, Shakespeare puts his finger on it somewhere: There are more things in heaven and earth, Horatio, Than are dreamt of in our philosophy.
-'Feeling and faith more forcefully persuade, Than the lens and the eye of a sage'. Thus it is that we close with two 'high-profile' attitudes towards Solovay's dictum that the continuum 'can be anything it ought to be', to both of which Woodin has contributed. On the one hand there is a putative L-like 'ultimate inner model' (leading to V = Ult-L) [Woo3], which permits adjunction of known large-cardinal axioms; under it the continuum is ℵ 1 . On the other hand is the argument, offered by Woodin in [Woo2], close in spirit to the Forcing Axioms of §8 as it depends on closure under (set) forcing in the presence of large cardinals; under this the continuum is ℵ 2 .