Unit 3 离散数学.ppt

Unit 3 Discrete Mathemtic Continuous mathematics Formal language theory Continuous-time Markov process Discrete topological space Discrete mathematics is described less by what is included than by what is excluded Contemporary work in descriptive set theory makes extensive use of traditional continuous mathematics trees are employed to construct efficient algorithms for locating items in a list. Universalquantification Logical connective Logically equivalent Simple path(circuit) Discrete graph(null graph) Compatible totalordering for a partial Ordering Free semigroup generated by A Distributive lattice Quential access Text A About discrete mathematic Discrete (1) Mathematics is the general term(2) for several branches of mathematics, which is based on the study of mathematical structures that are fundamentally discrete rather than continuous. In contrast to(3) real numbers that have the property(4) of varying smoothly, the objects studied in discrete mathematics – such as integers, graphs, and statements in logic – do not vary smoothly in this way, but have distinct(5), separated values.注1 Text A About discrete mathematic Discrete mathematics therefore excludes(6) topics in continuous mathematics(7) such as calculus(8) and analysis. Discrete objects can often be enumerated (9) by integers. More formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets(10) (sets that have the same cardinality(11) as subsets(12) of the integers, including rational(13) numbers but not real numbers). However, there is no exact, universally agreed, definition of the term discrete mathematics. Indeed, discrete mathematics is described less by what is included than(14) by what is excluded: continuously varying quantities and related notions (15). Research in discrete mathematics increased in the latter half of the twentieth century partly due to the development of digital computers which operate