南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论（IV）无穷 Infinity（简版）

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论（IV）无穷 Infinity

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论（III）函数 Function（简版）

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论（III）函数 Function

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论 II 关系 Relation（简版）

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论 II 关系 Relation

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论 I 公理与操作（简版）

南京大学：《计算机问题求解》课程教学资源（课件讲稿）集合论 I 公理与操作

The first three chapters cover the standard material on sets, relations, and functions and algorithms. Next come chapters on logic, counting, and probability. We then have three chapters on graph theory: graphs, directed graphs, and binary trees. Finally there are individual chapters on properties of the integers, languages, machines, ordered sets and lattices, and Boolean algebra, and appendices on vectors and matrices, and algebraic systems. The chapter on functions and algorithms includes a discussion of cardinality and countable sets, and complexity. The chapters on graph theory include discussions on planarity, traversability, minimal paths, and Warshall’s and Huffman’s algorithms. We emphasize that the chapters have been written so that the order can be changed without difficulty and without loss of continuity

1 Fundamentals 2 Collections 3 Counting and Relations 4 More Proof 5 Functions 6 Probability 7 Number Theory 8 Algebra 9 Graphs 10 Partially Ordered Sets