Descriptive Set Theory and Forcing: How to prove theorems about Borel sets the hard way

Descriptive Set Theory and Forcing: How to prove theorems about Borel sets the hard way

by Arnold Miller
Descriptive Set Theory and Forcing: How to prove theorems about Borel sets the hard way

Descriptive Set Theory and Forcing: How to prove theorems about Borel sets the hard way

by Arnold Miller

Paperback(1995)

$54.99 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Related collections and offers


Overview

An advanced graduate course. Some knowledge of forcing is assumed, and some elementary Mathematical Logic, e.g. the Lowenheim-Skolem Theorem. A student with one semester of mathematical logic and 1 of set theory should be prepared to read these notes. The first half deals with the general area of Borel hierarchies. What are the possible lengths of a Borel hierarchy in a separable metric space? Lebesgue showed that in an uncountable complete separable metric space the Borel hierarchy has uncountably many distinct levels, but for incomplete spaces the answer is independent. The second half includes Harrington's Theorem - it is consistent to have sets on the second level of the projective hierarchy of arbitrary size less than the continuum and a proof and appl- ications of Louveau's Theorem on hyperprojective parameters.

Product Details

ISBN-13: 9783540600596
Publisher: Springer Berlin Heidelberg
Publication date: 10/27/1995
Series: Lecture Notes in Logic , #4
Edition description: 1995
Pages: 133
Product dimensions: 6.10(w) x 9.25(h) x 0.01(d)

Table of Contents

1 What are the reals, anyway?.- I On the length of Borel hierarchies.- 2 Borel Hierarchy.- 3 Abstract Borel hierarchies.- 4 Characteristic function of a sequence.- 5 Martin’s Axiom.- 6 Generic G?.- 7—-forcing.- 8 Boolean algebras.- 9 Borel order of a field of sets.- 10 CH and orders of separable metric spaces.- 11 Martin-Solovay Theorem.- 12 Boolean algebra of order—1.- 13 Luzin sets.- 14 Cohen real model.- 15 The random real model.- 16 Covering number of an ideal.- II Analytic sets.- 17 Analytic sets.- 18 Constructible well-orderings.- 19 Hereditarily countable sets.- 20 Shoenfield Absoluteness.- 21 Mansfield-Solovay Theorem.- 22 Uniformity and Scales.- 23 Martin’s axiom and Constructibility.- 24 % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfKttLearuavP1wzZbItLDhis9wBH5garm % Wu51MyVXgaruWqVvNCPvMCaebbnrfifHhDYfgasaacH8srps0lbbf9 % q8WrFfeuY-Hhbbf9v8qqaqFr0xc9pk0xbba9q8WqFfea0-yr0RYxir % -Jbba9q8aq0-yq-He9q8qqQ8frFve9Fve9Ff0dmeaabaqaciGacaGa % aeqabaWaaeaaeaaakeaacqGHris5daqhaaWcbaGaeGOmaidabaGaeG % ymaedaaaaa!3322! $$ \sum _2sub1 $$ well-orderings.- 25 Large % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfKttLearuavP1wzZbItLDhis9wBH5garm % Wu51MyVXgaruWqVvNCPvMCaebbnrfifHhDYfgasaacH8srps0lbbf9 % q8WrFfeuY-Hhbbf9v8qqaqFr0xc9pk0xbba9q8WqFfea0-yr0RYxir % -Jbba9q8aq0-yq-He9q8qqQ8frFve9Fve9Ff0dmeaabaqaciGacaGa % aeqabaWaaeaaeaaakeaacqGHpis1daqhaaWcbaGaeGOmaidabaGaeG % ymaedaaaaa!3310! $$ \prod _2sub1 $$ sets.- III Classical Separation Theorems.- 26 Souslin-Luzin Separation Theorem.- 27 Kleene Separation Theorem.- 28 % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfKttLearuavP1wzZbItLDhis9wBH5garm % Wu51MyVXgaruWqVvNCPvMCaebbnrfifHhDYfgasaacH8srps0lbbf9 % q8WrFfeuY-Hhbbf9v8qqaqFr0xc9pk0xbba9q8WqFfea0-yr0RYxir % -Jbba9q8aq0-yq-He9q8qqQ8frFve9Fve9Ff0dmeaabaqaciGacaGa %aeqabaWaaeaaeaaakeaacqGHpis1daqhaaWcbaGaeGymaedabaGaeG % ymaedaaaaa!330E! $$ \prod _1sub1 $$-Reduction.- 29 % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfKttLearuavP1wzZbItLDhis9wBH5garm % Wu51MyVXgaruWqVvNCPvMCaebbnrfifHhDYfgasaacH8srps0lbbf9 % q8WrFfeuY-Hhbbf9v8qqaqFr0xc9pk0xbba9q8WqFfea0-yr0RYxir % -Jbba9q8aq0-yq-He9q8qqQ8frFve9Fve9Ff0dmeaabaqaciGacaGa % aeqabaWaaeaaeaaakeaacqGHuoardaqhaaWcbaGaeGymaedabaGaeG % ymaedaaaaa!32E3! $$ \Delta _1sub1 $$-codes.- IV Gandy Forcing.- 30 % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfKttLearuavP1wzZbItLDhis9wBH5garm % Wu51MyVXgaruWqVvNCPvMCaebbnrfifHhDYfgasaacH8srps0lbbf9 % q8WrFfeuY-Hhbbf9v8qqaqFr0xc9pk0xbba9q8WqFfea0-yr0RYxir % -Jbba9q8aq0-yq-He9q8qqQ8frFve9Fve9Ff0dmeaabaqaciGacaGa % aeqabaWaaeaaeaaakeaacqGHpis1daqhaaWcbaGaeGymaedabaGaeG % ymaedaaaaa!330E! $$ \prod _1sub1 $$ equivalence relations.- 31 Borel metric spaces and lines in the plane.- 32 % MathType!MTEF!2!1!+- % feaagCart1ev2aaatCvAUfKttLearuavP1wzZbItLDhis9wBH5garm % Wu51MyVXgaruWqVvNCPvMCaebbnrfifHhDYfgasaacH8srps0lbbf9 % q8WrFfeuY-Hhbbf9v8qqaqFr0xc9pk0xbba9q8WqFfea0-yr0RYxir % -Jbba9q8aq0-yq-He9q8qqQ8frFve9Fve9Ff0dmeaabaqaciGacaGa % aeqabaWaaeaaeaaakeaacqGHris5daqhaaWcbaGaeGymaedabaGaeG % ymaedaaaaa!3320! $$ \sum _1sub1 $$ equivalence relations.- 33 Louveau’s Theorem.- 34 Proof of Louveau’s Theorem.- References.- Elephant Sandwiches.
From the B&N Reads Blog

Customer Reviews