Chapter 25. Free Profinite Groups of Infinite Rank . . 25.1 Characterization of Free Profinite Groups by Embedding Problems 25.2 Applications of Theorem 25.1.7 . . . . . . . . 25.3 The Pro-C Completion of a Free Discrete Group . 25.4 The Group Theoretic Diamond Theorem . . . . 25.5 The Melnikov Group of a Profinite Group . . . 25.6 Homogeneous Pro-C Groups . . . . . . . . . 25.7 The S-rank of Closed Normal Subgroups . . . . 25.8 Closed Normal Subgroups with a Basis Element . 25.9 Accessible Subgroups . . . . . . . . . . . . Notes . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
592 598 601 603 610 612 617 620 622 630
. . . .
. . . .
. . . .
. . . .
632 632 637 639
. . . . . 591
. . . . . . . . .
Chapter 26. Random Elements in Free Profinite Groups . 26.1 Random Elements in a Free Profinite Group . . . 26.2 Random Elements in Free pro-p Groups . . . . . ˆn . . . . . . . . . . . . . 26.3 Random e-tuples in Z 26.4 On the Index of Normal Subgroups Generated by Random Elements . 26.5 Freeness of Normal Subgroups Generated by Random Elements Notes . . . . . . . . . . . . . . . . . . . . . . Chapter 27. Omega-Free PAC Fields . . . . . . . . . 27.1 Model Companions . . . . . . . . . . . . . 27.2 The Model Companion in an Augmented Theory of 27.3 New Non-Classical Hilbertian Fields . . . . . . 27.4 An abundance of ω-Free PAC Fields . . . . . . Notes . . . . . . . . . . . . . . . . . . . . .
. . . . 643 . . . . 648 . . . . 652
. . . . . . Fields . . . . . . . . .
. . 652 . . 652 . 656 . . 661 . . 664 . . 667
xiv
Table of Contents
Chapter 28. Undecidability . . . . . . . . . . . . . . 28.1 Turing Machines . . . . . . . . . . . . . . . 28.2 Computation of Functions by Turing Machines . . 28.3 Recursive Inseparability of Sets of Turing Machines 28.4 The Predicate Calculus . . . . . . . . . . . . 28.5 Undecidability in the Theory of Graphs . . . . . 28.6 Assigning Graphs to Profinite Groups . . . . . . 28.7 The Graph Conditions . . . . . . . . . . . . . 28.8 Assigning Profinite Groups to Graphs . . . . . . 28.9 Assigning Fields to Graphs . . . . . . . . . . . 28.10 Interpretation of the Theory of Graphs in the Theory of Fields Exercises . . . . . . . . . . . . . . . . . . . . . Notes . . . . . . . . . . . . . . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . . . .
668 668 669 673 676 679 684 685 687 691
. . . 691 . . . . 694 . . . . 694
Chapter 29. Algebraically Closed Fields with Distinguished Automorphisms 29.1 The Base Field K . . . . . . . . . . . . . . . . . 29.2 Coding in PAC Fields with Monadic Quantifiers . . . . ˜ σ1 , . . . , σe i’s 29.3 The Theory of Almost all hK, . . . . . . 29.4 The Probability of Truth Sentences . . . . . . . . .