English
Deutsch
Français
简体中文
繁體中文
Categories
Study
Novel
Nonfiction
Health
Tutorial
Entertainment
Business
Magazine
Arts & Design
Audiobooks & Video Training
Cultures & Languages
Family & Home
Law & Politics
Lyrics & Music
Software Related
eBook Torrents
Uncategorized
Share With Friends
Archive by Date
2012-08-05
2012-08-04
2012-08-03
2012-08-02
2012-08-01
2012-07-31
2012-07-30
2012-07-29
2012-07-28
Search Tag
Newest
Methods for Finding Zeros in Polynomials
Lectures on Stochastic Flows and Applications
Educational Psychology by Edward L. Thorndike
The Last Days of Tolstoy by V. G. Chertkov
Globalization and Responsibility
Lectures on Siegel Modular Forms and Representation by Quadratic Forms
Lectures on Topics In One-Parameter Bifurcation Problems
History of the Incas by Pedro Sarmiento de Gamboa
Linear Algebra: Theorems and Applications
Lectures on Stochastic Differential Equations and Malliavin Calculus
A Short Biographical Dictionary of English Literature
Lectures on Sieve Methods and Prime Number Theory
Dollars and Sense by William Crosbie Hunter
The Theory of the Theatre by Clayton Hamilton
The Mathematics of Investment
Occupiers of Wall Street: Losers or Game Changers
The Solution of the Pyramid Problem
Lectures on Moduli of Curves
Walden by Henry David Thoreau
Useful Links
Descriptive Set Theory and Forcing: How to Prove Theorems About Borel Sets the Hard Way (Lecture Notes in Logic, 4)
Posted on 2010-04-14
|  |
More This text is an advanced graduate course with some knowledge of forcing is assumed along with some elementary mathematical logic and set theory. The first half of the text 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 size less than on the continuum and a proof and applications of Louveau's Theorem on hyperprojective parameters.
Rating:
2.5 out of 5 by Book123 |
| Download Links | |
| Server | Status |
|---|---|
| Direct Download Link 1 | Alive |
| Direct Download Link 2 | Alive |
| Download Link (Download) | Alive |
| Download Link (Mirror) | Alive |
|
Buy This Book at Best Price >> | |
Related Articles
 | Science/Engineering Descriptive Set Theory and the Structure of Sets of Uniqueness Alexander S. Kechris, Alain Louveau “Descriptive Set Theory and the Structure of Sets of Uniqueness" Cambridge University Press | 1987-11-27 | ISBN:0521358116 | Djvu | 384 pages | 14,5 Mb The authors present some surprising connections ... |
 | Complexity, Logic, and Recursion Theory (Lecture Notes in Pure and Applied Mathematics) Complexity, Logic, and Recursion Theory (Lecture Notes in Pure and Applied Mathematics) Publisher: CRC | ISBN: 0824700260 | edition 1997 | DJVU + html | 384 pages | 11,32 mb"Integrates two classical approaches to computability. Offers deta ... |
 | Technical Termination Proofs for Logic Programs (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) ISBN: 3540528377 Publisher: Springer Author: Lutz PlümerDescription:Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But until n ... |
 | Technical Automated Deduction in Equational Logic and Cubic Curves (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) ISBN: 3540613986 Publisher: Springer Author: William McCune, R. PadmanabhanDescription:This monograph is the result of the cooperation of a mathematician working in universal algebra and geometry, and a computer scientist working in automat ... |
| Mathematics Descriptive Set Theory and the Structure of Sets of Uniqueness (London Mathematical Society Lecture Note Series) Author: Alexander S. Kechris, Alain LouveauPublisher: Cambridge University Press (1987)Binding: Paperback, 380 pagespricer: $75.00ISBN-10: 0521358116editorialreviewsThe authors present some surprising connections that sets of uniqueness for ... |
 | Mathematics Inductive Logic Programming: 14th International Conference, ILP 2004, Porto, Portugal, September 6-8, 2004, Proceedings (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) Author: Publisher: Springer (2004)Binding: Paperback, 361 pagespricer: $72.00ISBN-10: 3540229418editorialreviewsThis book constitutes the refereed proceedings of the 14th International Conference on Inductive Logic Programming, ILP 2004, he ... |
Comments (0)
