Title
Descriptive Set Theory and Forcing: How to prove theorems about Borel sets the hard way (Lecture Notes in Logic, 4),Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
An advanced graduate course. Some knowledge of forcing is assumed, and some elementary Mathematical Logic, e.g. the LowenheimSkolem 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.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.