Computational Prospects Of Infinity - Part Ii: Presented Talks
Published on 3. June 2008
Book
Hardback
432 pages
978-981-279-654-7 (ISBN)
Description
This volume is a collection of written versions of the talks given at the Workshop on Computational Prospects of Infinity, held at the Institute for Mathematical Sciences from 18 June to 15 August 2005. It consists of contributions from many of the leading experts in recursion theory (computability theory) and set theory. Topics covered include the structure theory of various notions of degrees of unsolvability, algorithmic randomness, reverse mathematics, forcing, large cardinals and inner model theory, and many others.
More details
Series
Language
English
Place of publication
Singapore
Singapore
Target group
College/higher education
Professional and scholarly
Product notice
sewn/stitched
Paper over boards
Dimensions
Height: 231 mm
Width: 157 mm
Thickness: 28 mm
Weight
748 gr
ISBN-13
978-981-279-654-7 (9789812796547)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Content
Prompt Simplicity, Array Computability and Cupping (R Downey et al.); A Simpler Short Extenders Forcing-Gap 3 (M Gitik); The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs (D R Hirschfeldt et al.); Absoluteness for Universally Baire Sets and the Uncountable II (I Farah et al.); Modaic Definability of Ordinals (I Neeman); Eliminating Concepts (A Nies); Diamonds on P (M Shioya); Rigidity and Biinterpretability in the Hyperdegrees (R A Shore); Some Fundamentals Issues Concerning Degrees or Unsolvability (S G Simpson); A tt Version of the Poner-Robinson Theorem (W H Woodin); and other papers.