ORPP logo
Image from Google Jackets

Axiomatic Set Theory.

By: Contributor(s): Material type: TextTextSeries: Contemporary MathematicsPublisher: Providence : American Mathematical Society, 1984Copyright date: ©1984Edition: 1st edDescription: 1 online resource (271 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780821876169
Subject(s): Genre/Form: Additional physical formats: Print version:: Axiomatic Set TheoryDDC classification:
  • 511.3/22
LOC classification:
  • QA248 -- .A95 1984eb
Online resources:
Contents:
Intro -- Table of Contents -- Preface -- Russell's earliest reactions to Cantorian set theory, 1896-1900 -- Sets of ordinals constructible from trees and the third Victoria Delfino problem -- Existence of bases implies the axiom of choice -- Small extensions of models of set theory -- The pin-up conjecture -- Generic reals close to o# -- Families of almost disjoint functions -- Homomorphism axioms and lynxes -- Infinitary logic and o# -- An extravagant partition relation for a model of arithmetic -- Stationary subsets of inaccessible cardinals -- Rational perfect set forcing -- Indiscernibles, skies, and ideals -- On cardinal invariants of the continuum -- A note on the proper forcing axiom -- Souslin trees constructed from Morasses -- PKλ combinatorics I: Stationary coding sets rationalize the club filter.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Intro -- Table of Contents -- Preface -- Russell's earliest reactions to Cantorian set theory, 1896-1900 -- Sets of ordinals constructible from trees and the third Victoria Delfino problem -- Existence of bases implies the axiom of choice -- Small extensions of models of set theory -- The pin-up conjecture -- Generic reals close to o# -- Families of almost disjoint functions -- Homomorphism axioms and lynxes -- Infinitary logic and o# -- An extravagant partition relation for a model of arithmetic -- Stationary subsets of inaccessible cardinals -- Rational perfect set forcing -- Indiscernibles, skies, and ideals -- On cardinal invariants of the continuum -- A note on the proper forcing axiom -- Souslin trees constructed from Morasses -- PKλ combinatorics I: Stationary coding sets rationalize the club filter.

Description based on publisher supplied metadata and other sources.

Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

There are no comments on this title.

to post a comment.

© 2024 Resource Centre. All rights reserved.