Provability, Computability and Reflection ( Volume 102 )

Publication series ：Volume 102

Author： Beklemishev   Lev D.  

Publisher： Elsevier Science‎

Publication year： 2000

E-ISBN: 9780080955087

P-ISBN(Paperback): 9780444854018

P-ISBN(Hardback):  9780444854018

Subject： O144 Set Theory

Language： ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

Provability, Computability and Reflection

Chapter

Front Cover

pp.：  1 – 4

Set Theory: An Introduction to Independence Proofs

pp.：  4 – 5

Copyright Page

pp.：  5 – 9

Preface

pp.：  8 – 12

Contents

pp.：  9 – 8

Introduction

pp.：  12 – 18

Chapter I. The foundations of set theory

pp.：  18 – 64

Chapter II. Infinitary combinatorics

pp.：  64 – 111

Chapter III. The well-founded sets

pp.：  111 – 127

Chapter IV. Easy consistency proofs

pp.：  127 – 169

Chapter V. Defining definability

pp.：  169 – 182

Chapter VI. The constructible sets

pp.：  182 – 201

Chapter VII. Forcing

pp.：  201 – 268

Chapter VIII. Iterated forcing

pp.：  268 – 322

Bibliography

pp.：  322 – 326

Index of special symbols

pp.：  326 – 328

General Index

pp.：  328 – 332

The users who browse this book also browse


No browse record.