X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    Set theory : an introduction to independence proofs (1980)
    Amsterdam [u.a.] :North-Holland Publ.,
    Details
    UID:
    almafu_BV002247428
    Format: XVI, 313 S.
    ISBN: 0-444-85401-0 , 0-7204-2200-0
    Series Statement: Studies in logic and the foundations of mathematics 102
    Language: English
    Subjects: Mathematics
    RVK:
    SK 150
    RVK:
    SK 155
    Keywords: Mengenlehre ; Zahlentheorie ; Kardinalzahl ; Logik
    URL: Inhaltsverzeichnis
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
    FU Berlin get availability status
    TU Berlin get availability status
  • 2
    Online Resource
    Online Resource
    Generalized recursion theory II : proceedings of the 1977 Oslo Symposium (2010)
    Amsterdam : North-Holland Pub. Co
    Details
    UID:
    gbv_1655661795
    Format: Online Ressource (vii, 417 pages)
    Edition: Online-Ausg. [S.l.] HathiTrust Digital Library
    ISBN: 9780080955025 , 0080955029 , 0444851631 , 0720422000 , 0444854010 , 9780444851635
    Series Statement: Studies in logic and the foundations of mathematics v. 94
    Note: Includes bibliographical references. - Print version record , Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
    Additional Edition: ISBN 0444851631
    Additional Edition: ISBN 9780444851635
    Additional Edition: ISBN 0720422000
    Additional Edition: ISBN 0444854010
    Additional Edition: Erscheint auch als Druck-Ausgabe Symposium on Generalized Recursion Theory (2nd : 1977 : University of Oslo) Generalized recursion theory II Amsterdam : North-Holland Pub. Co, 1978
    Language: English
    Keywords: Electronic books ; Congress ; Electronic books ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext
    URL: lizenzpflichtig
    Author information: Fenstad, Jens Erik 1935-2020
    Author information: Sacks, Gerald E. 1933-2019
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Stabi Berlin
    UB Potsdam
  • 3
    Online Resource
    Online Resource
    Set theory : an introduction to independence proofs (1980)
    Amsterdam : North-Holland Pub. Co
    Details
    UID:
    gbv_1655655647
    Format: Online Ressource (xvi, 313 pages)
    Edition: Online-Ausg.
    ISBN: 9780080955087 , 0080955088 , 9780080570587 , 0080570585 , 9780444854018
    Series Statement: Studies in logic and the foundations of mathematics v. 102
    Content: Provability, Computability and Reflection
    Note: Includes bibliographical references and indexes. - Print version record
    Additional Edition: ISBN 0080570585
    Additional Edition: ISBN 0444854010
    Additional Edition: ISBN 0720422000
    Additional Edition: ISBN 0444868399
    Additional Edition: Erscheint auch als Druck-Ausgabe Kunen, Kenneth Set theory Amsterdam ; New York : North-Holland Pub. Co. ; New York : Sole distributors for the U.S.A. and Canada, Elsevier North-Holland, 1980
    Language: English
    Keywords: Mengenlehre ; Electronic books ; Electronic books
    URL: lizenzpflichtig
    URL: Volltext
    URL: lizenzpflichtig
    URL: lizenzpflichtig
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Stabi Berlin
    UB Potsdam
  • 4
    Online Resource
    Online Resource
    Set theory : an introduction to independence proofs (1980)
    Amsterdam :North-Holland Pub. Co.,
    Details
    UID:
    edocfu_9958071915202883
    Format: 1 online resource (331 p.)
    ISBN: 1-282-61867-9 , 9786612618673 , 0-08-095508-8
    Series Statement: Studies in logic and the foundations of mathematics ; v. 102
    Content: Provability, Computability and Reflection
    Note: Description based upon print version of record. , Front Cover; Set Theory: An Introduction to Independence Proofs; Copyright Page; Contents; Preface; Introduction; 1. Consistency results; 2. Prerequisites; 3. Outline; 4. How to use this book; 5. What has been omitted; 6. On references; 7. Theaxioms; Chapter I. The foundations of set theory; 1. Why axioms?; 2. Why formal logic?; 3. The philosophy of mathematics; 4. What we are describing; 5. Extensionality and Comprehension; 6. Relations, functions, and well-ordering; 7. Ordinals; 8. Remarks on defined notions; 9. Classes and recursion; 10. Cardinals; 11. The real numbers , 12. Appendix 1 : Other set theories13. Appendix 2: Eliminating defined notions; 14. Appendix 3 : Formalizing the metatheory; Exercises for Chapter; Chapter II. Infinitary combinatorics; 1. Almost disjoint and quasi-disjoint sets; 2. Martin's Axiom; 3. Equivalents of MA; 4. The Suslin problem; 5. Trees; 6. The c.u.b. filter; 7. O and 0+; Exercises for Chapter II; Chapter III. The well-founded sets; 1. Introduction; 2. Properties of the well-founded sets; 3. Well-founded relations; 4. The Axiom of Foundation; 5 . Induction and recursion on well-founded relations; Exercises for Chapter III , Chapter IV. Easy consistency proofs1. Three informal proofs; 2. Relativization; 3. Absoluteness; 4. The last word on Foundation; 5 . More absoluteness; 6. The H(K); 7. Reflection theorems; 8. Appendix 1: More on relativization; 9. Appendix 2: Model theory in the metatheory; 10. Appendix 3: Model theory in the formal theory; Exercises for Chapter IV; Chapter V. Defining definability; 1. Formalizing definability; 2. Ordinal definable sets; Exercises for Chapter V; Chapter VI. The constructible sets; 1. Basic properties of L; 2. ZF in L; 3. The Axiom of Constructibility; 4. AC and GCH in L , 5. 0 and 0+ in LExercises for Chapter VI; Chapter VII. Forcing; 1. General remarks; 2. Generic extensions; 3. Forcing; 4. ZFC in M[G]; 5. Forcing with finite partial functions; 6. Forcing with partial functions of larger cardinality; 7. Embeddings, isomorphisms, and Boolean-valued models; 8. Further results; 9. Appendix: Other approaches and historical remarks; Exercises for Chapter VII; Chapter VIII. Iterated forcing; 1. Products; 2. More on the Cohen model; 3. The independence of Kurepa's Hypothesis; 4. Easton forcing; 5. General iterated forcing; 6. The consistency of MA + +CH , 7. Countable iterationsExercises for Chapter VIII; Bibliography; Index of special symbols; General Index , English
    Additional Edition: ISBN 0-444-85401-0
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    FU Berlin
  • 5
    Online Resource
    Online Resource
    Set theory : an introduction to independence proofs (1980)
    Amsterdam :North-Holland Pub. Co.,
    Details
    UID:
    edoccha_9958071915202883
    Format: 1 online resource (331 p.)
    ISBN: 1-282-61867-9 , 9786612618673 , 0-08-095508-8
    Series Statement: Studies in logic and the foundations of mathematics ; v. 102
    Content: Provability, Computability and Reflection
    Note: Description based upon print version of record. , Front Cover; Set Theory: An Introduction to Independence Proofs; Copyright Page; Contents; Preface; Introduction; 1. Consistency results; 2. Prerequisites; 3. Outline; 4. How to use this book; 5. What has been omitted; 6. On references; 7. Theaxioms; Chapter I. The foundations of set theory; 1. Why axioms?; 2. Why formal logic?; 3. The philosophy of mathematics; 4. What we are describing; 5. Extensionality and Comprehension; 6. Relations, functions, and well-ordering; 7. Ordinals; 8. Remarks on defined notions; 9. Classes and recursion; 10. Cardinals; 11. The real numbers , 12. Appendix 1 : Other set theories13. Appendix 2: Eliminating defined notions; 14. Appendix 3 : Formalizing the metatheory; Exercises for Chapter; Chapter II. Infinitary combinatorics; 1. Almost disjoint and quasi-disjoint sets; 2. Martin's Axiom; 3. Equivalents of MA; 4. The Suslin problem; 5. Trees; 6. The c.u.b. filter; 7. O and 0+; Exercises for Chapter II; Chapter III. The well-founded sets; 1. Introduction; 2. Properties of the well-founded sets; 3. Well-founded relations; 4. The Axiom of Foundation; 5 . Induction and recursion on well-founded relations; Exercises for Chapter III , Chapter IV. Easy consistency proofs1. Three informal proofs; 2. Relativization; 3. Absoluteness; 4. The last word on Foundation; 5 . More absoluteness; 6. The H(K); 7. Reflection theorems; 8. Appendix 1: More on relativization; 9. Appendix 2: Model theory in the metatheory; 10. Appendix 3: Model theory in the formal theory; Exercises for Chapter IV; Chapter V. Defining definability; 1. Formalizing definability; 2. Ordinal definable sets; Exercises for Chapter V; Chapter VI. The constructible sets; 1. Basic properties of L; 2. ZF in L; 3. The Axiom of Constructibility; 4. AC and GCH in L , 5. 0 and 0+ in LExercises for Chapter VI; Chapter VII. Forcing; 1. General remarks; 2. Generic extensions; 3. Forcing; 4. ZFC in M[G]; 5. Forcing with finite partial functions; 6. Forcing with partial functions of larger cardinality; 7. Embeddings, isomorphisms, and Boolean-valued models; 8. Further results; 9. Appendix: Other approaches and historical remarks; Exercises for Chapter VII; Chapter VIII. Iterated forcing; 1. Products; 2. More on the Cohen model; 3. The independence of Kurepa's Hypothesis; 4. Easton forcing; 5. General iterated forcing; 6. The consistency of MA + +CH , 7. Countable iterationsExercises for Chapter VIII; Bibliography; Index of special symbols; General Index , English
    Additional Edition: ISBN 0-444-85401-0
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Charité
  • 6
    Online Resource
    Online Resource
    Set theory : an introduction to independence proofs (1980)
    Amsterdam :North-Holland Pub. Co.,
    Details
    UID:
    almahu_9947367866502882
    Format: 1 online resource (331 p.)
    ISBN: 1-282-61867-9 , 9786612618673 , 0-08-095508-8
    Series Statement: Studies in logic and the foundations of mathematics ; v. 102
    Content: Provability, Computability and Reflection
    Note: Description based upon print version of record. , Front Cover; Set Theory: An Introduction to Independence Proofs; Copyright Page; Contents; Preface; Introduction; 1. Consistency results; 2. Prerequisites; 3. Outline; 4. How to use this book; 5. What has been omitted; 6. On references; 7. Theaxioms; Chapter I. The foundations of set theory; 1. Why axioms?; 2. Why formal logic?; 3. The philosophy of mathematics; 4. What we are describing; 5. Extensionality and Comprehension; 6. Relations, functions, and well-ordering; 7. Ordinals; 8. Remarks on defined notions; 9. Classes and recursion; 10. Cardinals; 11. The real numbers , 12. Appendix 1 : Other set theories13. Appendix 2: Eliminating defined notions; 14. Appendix 3 : Formalizing the metatheory; Exercises for Chapter; Chapter II. Infinitary combinatorics; 1. Almost disjoint and quasi-disjoint sets; 2. Martin's Axiom; 3. Equivalents of MA; 4. The Suslin problem; 5. Trees; 6. The c.u.b. filter; 7. O and 0+; Exercises for Chapter II; Chapter III. The well-founded sets; 1. Introduction; 2. Properties of the well-founded sets; 3. Well-founded relations; 4. The Axiom of Foundation; 5 . Induction and recursion on well-founded relations; Exercises for Chapter III , Chapter IV. Easy consistency proofs1. Three informal proofs; 2. Relativization; 3. Absoluteness; 4. The last word on Foundation; 5 . More absoluteness; 6. The H(K); 7. Reflection theorems; 8. Appendix 1: More on relativization; 9. Appendix 2: Model theory in the metatheory; 10. Appendix 3: Model theory in the formal theory; Exercises for Chapter IV; Chapter V. Defining definability; 1. Formalizing definability; 2. Ordinal definable sets; Exercises for Chapter V; Chapter VI. The constructible sets; 1. Basic properties of L; 2. ZF in L; 3. The Axiom of Constructibility; 4. AC and GCH in L , 5. 0 and 0+ in LExercises for Chapter VI; Chapter VII. Forcing; 1. General remarks; 2. Generic extensions; 3. Forcing; 4. ZFC in M[G]; 5. Forcing with finite partial functions; 6. Forcing with partial functions of larger cardinality; 7. Embeddings, isomorphisms, and Boolean-valued models; 8. Further results; 9. Appendix: Other approaches and historical remarks; Exercises for Chapter VII; Chapter VIII. Iterated forcing; 1. Products; 2. More on the Cohen model; 3. The independence of Kurepa's Hypothesis; 4. Easton forcing; 5. General iterated forcing; 6. The consistency of MA + +CH , 7. Countable iterationsExercises for Chapter VIII; Bibliography; Index of special symbols; General Index , English
    Additional Edition: ISBN 0-444-85401-0
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    HU Berlin
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 0444850090?
Did you mean 0444850104?
Did you mean 0444414010?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages