没有合适的资源?快使用搜索试试~ 我知道了~
The Joy of Sets -- Fundamentals of Contemporary Set Theory.pdf
需积分: 9 9 下载量 23 浏览量
2019-05-28
13:40:30
上传
评论
收藏 10.56MB PDF 举报
温馨提示
试读
202页
The Joy of Sets -- Fundamentals of Contemporary Set Theory.pdf
资源推荐
资源详情
资源评论
Keith Devlin
The Joy
of
Sets
Fundamentals of
Contemporary Set Theory
Second Edition
With
11
illustrations
Springer-Verlag
New
York Berlin Heidelberg London Paris
f!B'
Tokyo Hong Kong Barcelona Budapest
\.f::!J
Keith
Devlin
School
of
Science
Saint
Mary's
College
of
California
Moraga,
CA
94575
USA
Editorial
Board
J.H.
Ewing
Department
of
Mathematics
Indiana
University
Bloomington,
IN
47405
USA
P.R.
Halmos
Department
of
Mathematics
Santa
Clara
University
Santa
Clara,
CA
95053
USA
F.
W.
Gehring
Department
of
Mathematics
University
of
Michigan
Ann
Arbor,
MI
48109
USA
Mathematics
Subject
Classification
(1991): 04-01, 03E30,
03E47
Library
of
Congress
Cataloging-in-Publication
Data
Devlin,
Keith
J.
The
joy
of
sets
:
fundamentals
of
contemporary
set
theory
/
Keith
Devlin. --
2nd
ed.,
completely
re-written.
p.
cm.
--
(Undergraduate
texts
in
mathematics)
Rev.
ed. of:
Fundamentals
of
Contemporary
set
theory
/
Keith
J.
Devlin.
June
1992.
Includes
bibliographical
references
and
index.
ISBN
0-387-94094-4
1.
Set
theory.
I. Devlin,
Keith
J.
Fundamentals
of
contemporary
set
theory.
II.
Title.
III. Series.
QA248.038
1993 93-4692
511,3'22--dc20
Printed
on
acid-free
paper.
© 1979, 1993
Springer-Verlag
New
York,
Inc.
The
first
edition
of
this
book
was
published
in
the
U
niversitext
series.
All
rights
reserved.
This
work
may
not
be
translated
or
copied
in
whole
or
in
part
without
the
written
permission
of
the
publisher
(Springer-Verlag
New
York,
Inc., 175
Fifth
Avenue,
New
York,
NY
10010,
USA),
except
for
brief
excerpts
in
connection
with
reviews
or
scholarly
analysis.
Use
in
connection
with
any
form
of
information
storage
and
retrieval,
electronic
adaptation,
computer
software,
or
by
similar
or
dis-
similar
methodology
now
known
or
hereafter
developed
is
forbidden.
The
use
of
general
descriptive
names,
trade
names,
trademarks,
etc.,
in
this
publica-
tion,
even
if
the
former
are
not
especially
identified,
is
not
to
be
taken
as
a sign
that
such
names,
as
understood
by
the
Trade
Marks
and
Merchandise
Marks
Act,
may
accordingly
be
used
freely
by
anyone.
Production
managed
by
Karen
Phillips,
manufacturing
supervised
by
Vincent
Scelta.
Photocomposed
pages
prepared
from
the
author's
L'\TEX file.
Printed
and
bound
by
R.R.
Donnelley
and
Sons,
Harrisonburg,
VA.
Printed
in
the
United
States
of
America.
9
876
5
432
ISBN
0-387-94094-4
Springer-Verlag
New
York
Berlin
Heidelberg
ISBN
3-540-94094-4
Springer-Verlag
Berlin
Heidelberg
New
York
Preface
This book provides
an
account of those
parts
of
contemporary
set
theory
of
direct relevance
to
other
areas of
pure
mathematics.
The
intended reader is
either
an
advanced-level
mathematics
undergraduate,
a beginning
graduate
student
in mathematics, or
an
accomplished
mathematician
who desires or
needs some familiarity with
modern
set theory.
The
book is
written
in a
fairly easy-going style, with minimal formalism.
In
Chapter
1,
the
basic principles of
set
theory
are developed
in
a 'naive'
manner. Here
the
notions of
'set',
'union', 'intersection', 'power
set',
'rela-
tion', 'function', etc., are defined
and
discussed. One assumption in writing
Chapter
1 has been
that,
whereas
the
reader
may
have
met
all of these
concepts before
and
be
familiar
with
their
usage, she
l
may
not
have con-
sidered
the
various notions as forming
part
of
the
continuous development
of a pure subject (namely, set theory). Consequently,
the
presentation is
at
the
same
time
rigorous
and
fast.
Chapter
2 develops
the
theory
of sets proper.
Starting
with
the
naive
set theory of
Chapter
1,
I begin
by
asking
the
question
'What
is a
set?'
At-
tempts
to
give a rigorous answer lead
naturally
to
the
axioms of set
theory
introduced by Zermelo
and
Fraenkel, which is
the
system
taken
as basic in
this book. (Zermelo-Fraenkel
set
theory
is
in fact
the
system now accepted
in 'contemporary set theory'.)
Great
emphasis is placed on
the
evolution
of
the
axioms as 'inevitable' results of
an
analysis of a highly intuitive no-
tion. For, although set
theory
has
to
be
developed as
an
axiomatic theory,
occupying as
it
does a well-established foundational position in
mathemat-
ics,
the
axioms themselves must
be
'natural';
otherwise everything would
reduce
to
a meaningless game
with
prescribed rules. After developing
the
axioms, I go on
to
discuss
the
recursion
principle-which
plays a central
role in
the
development of set
theory
but
is
nevertheless still widely misun-
derstood
and
rarely appreciated
fully-and
the
Axiom of Choice, where I
prove all of
the
usual variants, such as Zorn's Lemma.
1I use
both
'he'
and
'she'
as
gender-neutral
pronouns
interchangeably
throughout
the
book.
v
vi PREFACE
Chapter
3 deals
with
the
two basic
number
systems,
the
ordinal num-
bers,
and
the
cardinal numbers.
The
arithmetics of
both
systems are de-
veloped sufficiently
to
allow for most applications outside set theory.
In
Chapter
4,
I delve into
the
subject
set
theory
itself. Since contem-
porary
set
theory
is
a very large subject, this foray
is
of necessity very
restricted. I have two aims in including it. First,
it
provides good examples
of
the
previous theory.
And
second,
it
gives
the
reader some idea of
the
flavor of
at
least some
parts
of
pure
set theory.
Chapter
5 presents a modification of Zermelo-Fraenkel set theory.
The
Zermelo-Fraenkel system has a
major
defect as a foundational subject.
Many easily formulated problems
cannot
be solved in
the
system.
The
Axiom of Constructibility is
an
axiom
that,
when added
to
the
Zermelo-
Fraenkel system, eliminates most, if
not
all, of these undecidable problems.
In
Chapter
6,
I give
an
account of
the
method
by which one
can
prove
within
the
Zermelo-Fraenkel system
that
various
statements
are themselves
not
provable in
that
system.
Chapters
5
and
6 are nonrigorous. My aim is
to
explain
rather
than
develop.
They
are included because of
their
relevance
to
other
areas of
mathematics. A detailed investigation of these topics would double
the
length of
this
book
at
the
very least
and
as such is
the
realm of
the
set-
theorist,
though
I would,
of
course,
be
delighted
to
think
that
any of my
readers would
be
encouraged
to
go further into these
matters.
Finally,
in
Chapter
7,
I present
an
introductory
account of
an
alternative
conception of set
theory
that
has proved useful in computer science (and
elsewhere),
the
non-well-founded set
theory
of
Peter
Aczel.
Chapters
1
through
3 contain numerous easy exercises.
In
Chapters
1
and
2,
they
are formally designated as 'Exercises'
and
are intended for
solution as
the
reader proceeds.
The
aim is
to
provide enough material
to
help
the
student
understand
fully
the
concepts
that
are introduced.
In
Chapter
3,
the
exercises
take
the
form of simple proofs of basic lemmas,
which are left
to
the
reader
to
provide. Again,
the
aim is
to
assist
the
reader's comprehension.
At
the
end
ofeach of
Chapters
1
through
3, there is also a small selection
of problems. These are more challenging
than
the
exercises
and
constitute
digressions from,
or
extensions of,
the
main
development.
In
some instances
the
reader
may
need
to
seek assistance in order
to
do these problems.
This
book is a
greatly
expanded second edition of my earlier Fundamen-
tals
of
Contemporary
Set
Theory, published by Springer-Verlag in 1979.
In
addition
to
the
various changes I have
made
to
my original account, I could
not
resist a change in title, relegating
the
title
of
the
first edition
to
a sub-
title
for
the
second,
thereby
enabling me
to
join
the
growing ranks of Joy
剩余201页未读,继续阅读
资源评论
osakaanarg
- 粉丝: 30
- 资源: 474
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- python-leetcode面试题解之第157题用Read4读取N个字符-题解.zip
- python-leetcode面试题解之第156题上下翻转二叉树-题解.zip
- python-leetcode面试题解之第155题最小栈-题解.zip
- python-leetcode面试题解之第153题寻找旋转排序数组中的最小值-题解.zip
- python-leetcode面试题解之第152题乘积最大子数组-题解.zip
- python-leetcode面试题解之第151题反转字符串中的单词-题解.zip
- python-leetcode面试题解之第150题逆波兰表达式求值-题解.zip
- python-leetcode面试题解之第149题直线上最多的点数-题解.zip
- python-leetcode面试题解之第148题排序链表-题解.zip
- python-leetcode面试题解之第147题对链表进行插入排序-题解.zip
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功