Phu Xuan University Library
Elementary Foundations: An Introduction to Topics in Discrete Mathematics

External

Elementary Foundations: An Introduction to Topics in Discrete Mathematics

Author
Jeremy Sylvestre
Publisher
University of Alberta Augustana
Source
LibreTexts
License
GNU FDL
Language
EN
Category
Basic Sciences
Contents· 160 sections
  1. 01: Symbolic language
  2. 1.01: Statements
  3. 1.02: Converting language to symbols
  4. 1.03: Logical Analysis
  5. 1.04: Tautologies and contradictions
  6. 1.05: Activities
  7. 1.06: Exercises
  8. 02: Logical equivalence
  9. 2.01: Equivalence
  10. 2.02: Propositional Calculus
  11. 2.03: Converse Inverse and Contrapositive
  12. 2.04: Activities
  13. 2.05: Exercises
  14. 03: Boolean algebra
  15. 3.01: Boolean Polynomials
  16. 3.02: Disjunctive Normal Form
  17. 3.03: Exercises
  18. 04: Predicate logic
  19. 4.01: Predicates and Quantifers
  20. 4.02: Manipulating quantified statements
  21. 4.03: Vacuously true statements
  22. 4.04: Activities
  23. 4.05: Exercises
  24. 05: Arguments
  25. 5.01: Basic
  26. 5.02: Standard Arguments
  27. 5.03: Substituting into an argument
  28. 5.04: Activities
  29. 06: Definitions and proof methods
  30. 6.01: Definitions
  31. 6.02: Common mathematical statements
  32. 6.03: Direct Proof
  33. 6.04: Reduction to Cases
  34. 6.05: Statements Involving Disjunction
  35. 6.06: Proving the contrapositive
  36. 6.07: Proof by counterexample
  37. 6.08: Proving biconditionals
  38. 6.09: Proof by Contradiction
  39. 6.10: Existence and Uniqueness
  40. 6.11: Activities
  41. 6.12: Exercises
  42. 07: Proof by mathematical induction
  43. 7.01: Principle of Mathematical Induction
  44. 7.02: An application to logic
  45. 7.03: Strong form of Mathematical Induction
  46. 7.04: Activities
  47. 08: Axiomatic systems
  48. 8.01: Basics and examples
  49. 8.02: Incompleteness of axiomatic systems
  50. 8.03: Exercises
  51. 09: Sets
  52. 9.01: Basics
  53. 9.02: Defining sets
  54. 9.03: Subsets and equality of sets
  55. 9.04: Complement union and intersection
  56. 9.05: Cartesian Product
  57. 9.06: Alphabets and words
  58. 9.07: Sets of sets
  59. 9.08: Activities
  60. 9.09: Exercises
  61. 10: Functions
  62. 10.01: Basics
  63. 10.02: Properties of Functions
  64. 10.03: Important Examples
  65. 10.04: Composition of functions
  66. 10.05: Inverses
  67. 10.06: Activities
  68. 10.07: Exercises
  69. 11: Recurrence and induction
  70. 11.01: Sequences
  71. 11.02: Recurrence Relations
  72. 11.03: Solving through Iteration
  73. 11.04: Inductive definitions
  74. 11.05: Activities
  75. 11.06: Exercises
  76. 12: Cardinality
  77. 12.01: Finite Sets
  78. 12.02: Properties of finite sets and their cardinality
  79. 12.03: Relative Sizes of Sets
  80. 12.04: Counting elements of finite sets with bijections
  81. 12.05: Activities
  82. 12.06: Exercises
  83. 13: Countable and uncountable sets
  84. 13.01: Basics and Examples
  85. 13.02: Properties
  86. 13.03: More about relative sizes of sets
  87. 13.04: Activities
  88. 14: Graphs
  89. 14.01: Basics and Examples
  90. 14.02: Properties of Graphs
  91. 14.03: Adding Information to Graphs
  92. 14.04: Important Examples
  93. 14.05: Activities
  94. 14.06: Exercises
  95. 15: Paths and connectedness
  96. 15.01: Motivation
  97. 15.02: Walks trails and paths
  98. 15.03: Connected Vertices Graphs and Components
  99. 15.04: Articulation vertices bridges and edge connectivity
  100. 15.05: Activities
  101. 15.06: Exercises
  102. 16: Trees and searches
  103. 16.01: Motivation
  104. 16.02: Basics
  105. 16.03: Identifying Trees
  106. 16.04: Depth-first and breadth-first searches
  107. 16.05: Spanning Trees
  108. 16.06: Binary Searches
  109. 16.07: Activities
  110. 16.08: Exercises
  111. 17: Relations
  112. 17.01: Basics
  113. 17.02: Operations on Relations
  114. 17.03: Properties of Relations
  115. 17.04: Graphing Relations
  116. 17.05: Activities
  117. 17.06: Exercises
  118. 18: Equivalence relations
  119. 18.01: Motivation
  120. 18.02: Basics and Examples
  121. 18.03: Classes partitions and quotients
  122. 18.04: Important examples
  123. 18.05: Graph for an equivalence relation
  124. 18.06: Activities
  125. 18.07: Exercises
  126. 19: Partially ordered sets
  127. 19.01: Motivation
  128. 19.02: Definition and properties
  129. 19.03: Graph for a partial order
  130. 19.04: Total Orders
  131. 19.05: Maximal minimal Elements
  132. 19.06: Topological Sorting
  133. 19.07: Activities
  134. 19.08: Exercises
  135. 20: Counting
  136. 20.01: Motivation
  137. 20.02: Addition and subtraction rules
  138. 20.03: Multiplication Rule
  139. 20.04: Division Rule
  140. 20.05: Pigeonhole Principle
  141. 20.06: Activities
  142. 20.07: Exercises
  143. 21: Permutations
  144. 21.01: Factorials
  145. 21.02: Definition
  146. 21.03: Counting Permutations
  147. 21.04: Permutations of Subsets
  148. 21.05: Activities
  149. 22: Combinations
  150. 22.01: Motivation
  151. 22.02: Basics
  152. 22.03: Applications
  153. 22.04: Properties
  154. 22.05: Activities
  155. 22.06: Exercises
  156. 23: Binomial and multinomial coefficients
  157. 23.01: Bionomial Coefficients
  158. 23.02: Multinomial Coefficients
  159. 23.03: Applications
  160. 23.04: Exercises