Recursive Aspects of Descriptive Set TheoryExplores the nature of infinity with a view toward classifying and explaining its mathematical applications. It presents not only the basics of the classical theory, but also an introduction to the many important recent results and methods. |
Contents
Some Definitions and Examples | 1 |
Borel Sets | 19 |
Normal Forms | 32 |
Copyright | |
8 other sections not shown
Common terms and phrases
₁א A₁ arithmetic auxillary game axiom of choice axiom of extensionality bad Q-array Baire set Baire space Borel set chapter Clearly closed sets cone contains continuous function contradiction Corollary countable models countable ordinal defined Definition denote dense descriptive set theory disjoint E₁ elementary embedding endnode equivalence relation Example finite sequences formula function f Gödel number height Hence hyperarithmetic infinite path Infinity integers isomorphic Lemma Let F lh(s linearly ordered sets minimal bad non-empty non-standard ordinal normal form order preserving map pairs perfect set perfect subset perfect tree player predicate Proof Proposition prove quasiordered rank recursive tree recursively coded satisfies semi-effective set coded set of integers set of reals Shoenfield thin III set topology transfinite uncountable w-model for KP w₁ well-founded tree well-ordering winning strategy αο ωλ