Picture 1 of 1

Stock photo

Jindrich Zaplet Structure And Randomness In Computability (Hardback) (UK IMPORT) - Picture 1 of 1

Computability, Forcing and Descriptive Set Theory by Christopher Porter (2019, Hardcover)

Rarewaves (641938)

98.2% positive feedback

Price:

US $234.18

(inclusive of GST)

ApproximatelyS$ 301.39

+ $4.35 shipping

Estimated delivery Mon, 30 Jun - Fri, 4 Jul

Returns:

30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Brand New

About this product

Product Identifiers

PublisherWorld Industries Scientific Publishing Co Pte LTD

ISBN-109813228229

ISBN-139789813228221

eBay Product ID (ePID)4038733371

Product Key Features

Number of Pages200 Pages

LanguageEnglish

Publication NameComputability, Forcing and Descriptive Set Theory

Publication Year2019

SubjectComputer Science, General, Set Theory, Logic

TypeTextbook

Subject AreaMathematics, Computers

AuthorChristopher Porter

FormatHardcover

Dimensions

Item Weight0 Oz

Additional Product Features

Intended AudienceTrade

LCCN2020-034089

Dewey Edition23

Dewey Decimal511.322

SynopsisThis volume presents some exciting new developments occurring on the interface between set theory and computability as well as their applications in algebra, analysis and topology. These include effective versions of Borel equivalence, Borel reducibility and Borel determinacy. It also covers algorithmic randomness and dimension, Ramsey sets and Ramsey spaces. Many of these topics are being discussed in the NSF-supported annual Southeastern Logic Symposium., This volume presents some exciting new developments occurring on the interface between set theory and computability as well as their applications in algebra, analysis and topology. These include effective versions of Borel equivalence, Borel reducibility and Borel determinacy. It also covers algorithmic randomness and dimension, Ramsey sets and Ramsey spaces. Many of these topics are being discussed in the NSF-supported annual Southeastern Logic Symposium. Contents: Limits of the Kucerea-Gacs Coding Method (George Barmpalias and Andrew Lewis-Pye) ; Infinitary partition properties of sums of selective ultrafilters (Andreas Blass) ; Semiselective Coideals and Ramsey Sets (Carlos DiPrisco and Leonardo Pacheco) ; Survey on Topological Ramsey Spaces Dense in Forcings (Natasha Dobrinen) ; Higher Computability in the Reverse Mathematics of Borel Determinacy (Sherwood Hachtman) ; Computability and Definability (Valentina Harizanov) ; A Ramsey Space of Infinite Polyhedra and the Random Polyhedron (Jose G Mijares Palacios and Gabriel Padilla) ; Computable Reducibility for Cantor Space (Russell G Miller) ; Information vs Dimension - An Algorithmic Perspective (Jan Reimann) ; Readership: Graduate students and researchers interested in the interface between set theory and computability.

LC Classification NumberQA248.S892 2021