Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

Sets and Logic
1.1 Logical notation
1.1.1 Patterns of proof
1.2 Sets
1.3 Set laws
1.3.1 The Boolean algebra of sets
1.3.2 Venn diagrams
1.3.3 Boolean algebra and properties
1.4 Propositional logic
1.4.1 Boolean propositions
1.4.2 Models
1.4.3 Truth assignments
1.4.4 Truth tables
1.4.5 Methods
2.2.2 Direct and inverse image of a relation
2.3 Relations as structure
2.3.1 Directed graphs
2.3.2 Equivalence relations
2.3.3 Partial orders
2.4 Size of sets
2.4.1 Countability
2.4.2 Uncountability
Constructions on sets
3.2 Constructing sets
3.2.1 Basic sets
3.2.2 Constructions
3.2.3 Axioms of set theory
3.3 Some consequences
3.3.1 Sets of functions
3.3.2 Sets of unlimited size
Inductive deﬁnitions
4.1 Sets deﬁned by rules—examples
4.2 Inductively-deﬁned sets
4.3 Rule induction
4.3.1 Transitive closure of a relation
4.4 Derivation trees
4.5 Least ﬁxed points
4.6 Tarski’s ﬁxed point theorem
Well-founded induction
5.1 Well-founded relations
5.2 Well-founded induction
5.3 Building well-founded relations
5.3.1 Fundamental well-founded relations
5.3.2 Transitive closure
5.3.3 Product
5.3.4 Lexicographic products
5.3.5 Inverse image
5.4 Applications
5.4.1 Euclid’s algorithm for hcf
5.4.2 Eulerian graphs
5.4.3 Ackermann’s function
5.5 Well-founded recursion
5.5.1 The proof of well-founded recursion
0 of .
Results for:
P. 1
Disc Math

# Disc Math

Ratings: (0)|Views: 2 |Likes:

See more
See less

10/02/2013

pdf

text

original