Comparison Process for Mouse Pairs

Comparison Process for Mouse Pairs

EnglishHardbackPrint on demand
Steel John R.
Cambridge University Press
EAN: 9781108840682
Print on demand
Delivery on Wednesday, 1. of July 2026
CZK 3,645
Common price CZK 4,050
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

This book proves some important new theorems in the theory of canonical inner models for large cardinal hypotheses, a topic of central importance in modern set theory. In particular, the author 'completes' the theory of Fine Structure and Iteration Trees (FSIT) by proving a comparison theorem for mouse pairs parallel to the FSIT comparison theorem for pure extender mice, and then using the underlying comparison process to develop a fine structure theory for strategy mice. Great effort has been taken to make the book accessible to non-experts so that it may also serve as an introduction to the higher reaches of inner model theory. It contains a good deal of background material, some of it unpublished folklore, and includes many references to the literature to guide further reading. An introductory essay serves to place the new results in their broader context. This is a landmark work in inner model theory that should be in every set theorist's library.
EAN 9781108840682
ISBN 110884068X
Binding Hardback
Publisher Cambridge University Press
Publication date November 24, 2022
Pages 550
Language English
Dimensions 235 x 157 x 37
Country United Kingdom
Authors Steel John R.
Illustrations Worked examples or Exercises
Series Lecture Notes in Logic
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.