0% found this document useful (0 votes)
64 views12 pages

Discrete Mathematics

Mathematics

Uploaded by

loarifse16
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
64 views12 pages

Discrete Mathematics

Mathematics

Uploaded by

loarifse16
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Discrete Mathematics

Introduction
So Why Discrete Math?

● As a way to get introduced to proof based mathematics!


● A mathematical basis for most areas of computer science
○ Artificial Intelligence (ML, logic, KR&R, automated theorem proving)
○ compilers,programming languages theory, computability
○ Formal verification, Cryptography, Distributed systems

● And many more fields within Computing depend on concepts from discrete math!
● Very different from the math you are used to ( highschool math, calculus,...)
Administrivia - Outline

● Even though there are a lot of applications of Discrete math….


● We will mainly focus on writing mathematical proofs about different discrete
structures. The mathematical foundations!
● We will mostly cover the chapters from Kenneth Rosen’s Discrete Mathematics book,
topics include:
○ logic, formal & informal proofs
○ sets & functions
○ number theory, modular arithmetic, congruences
○ induction & recursion
○ combinatorics & discrete probability
○ basic graph theory
Computer Game Playing
● Computer game playing is
one interesting area in which
concepts from discrete math
are applied to.
Kasparov
Vs
DeepBlue (a chess program)
General Game Playing
● Playing one game is one thing, and
is hard by itself but how about…
● playing any arbitrary game
supplied?!
● One way to do this is to use Formal
Logic and Automated Reasoning.
DEMO - GGP
The foundations
Before we begin doing maths, let’s ask this question….

What is mathematics?
- There are a lot of opinions about this (the logicist view, the platonist, the
intuitionist…)
- Let’s consider one that might be helpful
- The formalist view:
- Meaningless manipulation of symbols according to some specific and precise rules.
- {P, P->Q} |= Q
- You can “go” from the symbols on the left to the symbol on the right of ‘|=’
Proofs
A proof is a method of establishing truth. This is done in many different ways in everyday

life:
- Jury trial: Truth is ascertained by twelve people selected at random.
- Word of God: Truth is ascertained by communication with God, perhaps via a third party.
- Experimental science: The truth is guessed and the hypothesis is confirmed or refuted by experiments.
- Sampling: The truth is obtained by statistical analysis of many bits of evidence. For example, public
opinion is obtained by polling only a representative sample.
- Inner conviction: “My program is perfect. I know this to be true.”
- “I don‘t see why not...”: Claim something is true and then shift the burden of proof to anyone who
disagrees with you.
- Intimidation: Truth is asserted by someone with whom disagreement seems unwise. (e.g. your
government.)
(informal) Proofs
- Mathematics has its own way of asserting truth. We use mathematical proofs to
establish truth.
- A Mathematical proof: is a verification of a proposition by a chain of logical
deductions from a base set of axioms.
- A bit of terminology:
- A proposition: is a statement that is either true or false.
- 2+3=5
- It is raining outside.
- For all natural numbers, n, we have n 2 + n + 41 is a prime number.
- Let’s try to do it exhaustively
(informal) Proofs continued…
- An axiom: is a set of propositions assumed to be true without any proof. (Somehow
arbitrary)
- logical deductions (inference rules): are used to combine axioms and true
propositions in order to form more true propositions. (e.g Modus ponens)
- A theorem: is a statement that can be shown to be true.
- We have mainly two types of proofs.
- Formal Proofs: Which are symbolic, computer checkable, and very rigorous proofs.
- Informal Proofs: What we will mostly be using, and what most mathematicians use. A mixture of
symbolism and english words.
An excerpt
from principia
mathematica

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy