0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic

Buy Now

E-recursion, Forcing And C*-algebras (Hardcover) Loot Price: R2,063
Discovery Miles 20 630
E-recursion, Forcing And C*-algebras (Hardcover): Chitat Chong, Qi Feng, Yue Yang, Theodore a. Slaman, W. Hugh Woodin

E-recursion, Forcing And C*-algebras (Hardcover)

Chitat Chong, Qi Feng, Yue Yang, Theodore a. Slaman, W. Hugh Woodin

Series: Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, 27

 (sign in to rate)
Loot Price R2,063 Discovery Miles 20 630 | Repayment Terms: R193 pm x 12*

Bookmark and Share

Expected to ship within 12 - 17 working days

This volume presents the lecture notes of short courses given by three leading experts in mathematical logic at the 2012 Asian Initiative for Infinity Logic Summer School. The major topics cover set-theoretic forcing, higher recursion theory, and applications of set theory to C*-algebra. This volume offers a wide spectrum of ideas and techniques introduced in contemporary research in the field of mathematical logic to students, researchers and mathematicians.

General

Imprint: World Scientific Publishing Co Pte Ltd
Country of origin: Singapore
Series: Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, 27
Release date: July 2014
First published: 2014
Editors: Chitat Chong • Qi Feng • Yue Yang • Theodore a. Slaman • W. Hugh Woodin
Dimensions: 229 x 152 x 23mm (L x W x T)
Format: Hardcover - Cloth over boards
Pages: 228
ISBN-13: 978-981-4602-63-1
Categories: Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic
LSN: 981-4602-63-9
Barcode: 9789814602631

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners