A hierarchy of formulas in set theory / [electronic resource] by Azriel L�evy.
Material type:
TextSeries: Memoirs of the American Mathematical Society ; no. 57.Publication details: Providence, R.I. : American Mathematical Society, 1965.Description: 1 online resource (76 p.)ISBN: - 9781470400033 (online)
- QA3 .A57 no. 57
E-BOOKS
| Home library | Call number | Materials specified | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| IMSc Library | Link to resource | Available | EBK12510 |
Includes bibliographical references.
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�owenheim theorem with the axiom of dependent choices
Access is restricted to licensed institutions
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
Mode of access : World Wide Web
Description based on print version record.
There are no comments on this title.