Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
A Hierarchy of Formulas in Set Theory
 
A Hierarchy of Formulas in Set Theory
eBook ISBN:  978-1-4704-0003-3
Product Code:  MEMO/1/57.E
List Price: $23.00
MAA Member Price: $20.70
AMS Member Price: $18.40
A Hierarchy of Formulas in Set Theory
Click above image for expanded view
A Hierarchy of Formulas in Set Theory
eBook ISBN:  978-1-4704-0003-3
Product Code:  MEMO/1/57.E
List Price: $23.00
MAA Member Price: $20.70
AMS Member Price: $18.40
  • Book Details
     
     
    Memoirs of the American Mathematical Society
    Volume: 11965; 76 pp
    MSC: Primary 03
  • Table of Contents
     
     
    • Chapters
    • 1. Introduction
    • 2. Definition of the hierarchy
    • 3. The relative hierarchy
    • 4. Formulas in $\Sigma _0$ and admissible terms
    • 5. The satisfaction predicates
    • 6. The semantical hierarchy theorem
    • 7. Undecidable sentences
    • 8. The syntactical hierarchy theorems
    • 9. Reflection phenomena
    • 10. The lower levels of the hierarchy
    • Appendix A. The dependence of the results on the axiom of foundation
    • Appendix B. The Boolean closure of $\Sigma _j$
    • Appendix C. Complete reflection in Ackermann’s set theory
    • Appendix D. Equivalence of the Skolem-Löwenheim theorem with the axiom of dependent choices
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 11965; 76 pp
MSC: Primary 03
  • Chapters
  • 1. Introduction
  • 2. Definition of the hierarchy
  • 3. The relative hierarchy
  • 4. Formulas in $\Sigma _0$ and admissible terms
  • 5. The satisfaction predicates
  • 6. The semantical hierarchy theorem
  • 7. Undecidable sentences
  • 8. The syntactical hierarchy theorems
  • 9. Reflection phenomena
  • 10. The lower levels of the hierarchy
  • Appendix A. The dependence of the results on the axiom of foundation
  • Appendix B. The Boolean closure of $\Sigma _j$
  • Appendix C. Complete reflection in Ackermann’s set theory
  • Appendix D. Equivalence of the Skolem-Löwenheim theorem with the axiom of dependent choices
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.