Anda di halaman 1dari 23

MATEMATIKA

Kuliah Matrikulasi
Semester Ganjil Tahun Akademik 2012/2013

Program Magister Manajemen

Pokok Bahasan
1. Pendahuluan, Logika 2. Fungsi, grafik, dan penerapannya 3. Diferensial dan Optimasi 4. Probabilitas dalam Keputusan Bisnis

Matematika 1: PENDAHULUAN, LOGIKA


1. PENDAHULUAN: Berpikir Induktif dan Deduktif 2. LOGIKA

1.1. Inductive & Deductive Reasoning

INDUCTIVE REASONING: the process of arriving at a general conclusion based on observation of specific examples DEDUCTIVE REASONING: the process of proving a specific conclusion from one or more general statements. The conclusion is called a theorem

Kita meneliti sidik jari 1000 orang, ternyata tidak ada 2 orang pun yang memiliki sidik jari yang sama. Kita simpulkan bahwa untuk semua orang, tidak ada 2 orang yang memiliki sidik jari yang sama. Semua mahasiswa baru harus tinggal di asrama dan mahasiswa yang tinggal di asrama tidak boleh membawa mobil. Yudi adalah mahasiswa baru. Bisa kita simpulkan bahwa Yudi tidak boleh membawa mobil.

counterexample

Tidak ada penyanyi yang mau jadi pelawak Bila suatu bilangan dikalikan dengan dirinya sendiri, hasilnya adalah bilangan genap

The sum of two three-digit numbers is a four-digit number

8, 12, 16, 20, 24, ., .

Pilih sebuah bilangan sembarang. Kalikan dengan 4. Hasilnya tambah dengan 8. Jumlah tsb bagi dengan 2. Hasilnya kurangi dengan 4. Kelompok A: pilih 3 bilangan berbeda Kelompok B: nyatakan bilangan tsb n

Matematika 1: PENDAHULUAN, LOGIKA


LOGIKA: 3.1. Statements, Negations, Quantified statements 3.2. Compound Statements & Connectives 3.3. Truth Tables for Negations, Conjunction, Disjunction 3.4. Truth Tables for the Conditional & the Biconditional 3.5. Equivalent Statements, Variations of Conditional Statements

3.1. Statements, Negations, Quantified statements


A Statement: a sentence that is either true or false, but not both simultaneously

1. Statements and negation using symbols

2. Quantified statements and their negations

Statements & Negations:

Contoh:
p : Surabaya adalah ibu kota Prov. Jatim q : Presiden pertama RI adalah Ibu Megawati

negation p ( ~p ):

Quantified Statements

adalah pernyataan yang mengandung salah satu quantifiers (: all, some,

Statemen t

no /none)

An equivalent way to express the Statement

p: All A are B There are no

~p=s ~q=r

A that are not B q: Some A There exists are B at least one A that is a B r: No A are B All A are not B

s: Some A
are not B

Not all A are B

3.2. Compound Statements & Connectives


Name Negation Conjunction Disjunction Conditional Biconditional Symbolic Form ~p Not p Read

p q pq pq p q

p and q p or q
If p, then q

p if and only if q

p: Romeo loves Juliet q: Juliet loves Romeo

1. ~ ( p q ) 2. ~p q 3. ~ (q p) 4. ~ q p 5. ~p ~q 6. ~q ~p 7. p q

3.3. Truth Tables for Negations, Conjunction, and Disjunction


1. Negation : not - The negation of a statement has the opposite truth value from the statement

p
T

~p
F

3.3. Truth Tables for Negations, Conjunction, and Disjunction


2. Conjunction - A conjunction is true only when both component statements are true

p
T

q
T

p q
T

T
F F

F
T F

F
F F

3.3. Truth Tables for Negations, Conjunction, and Disjunction


3. Disjunction - A disjunction is false only when both component statements are false

p
T

q
T

pq
T

T
F F

F
T F

T
T F

3.4. Truth Tables for the Conditional & Biconditional


Conditional - A conditional is false only when the antecedent is true and the consequent is false The truth value of a conditional statement does not change if the antecedent and consequent are reversed and both are negated
1.

p
T T

q
T F

pq
T F

~q ~ p T F

F
F

T
F

T
T

T
T

3.4. Truth Tables for the Conditional & Biconditional


2. Biconditional A biconditional is true only when the component statements have the same truth value

p
T

q
T

pq
T

T
F F

F
T F

F
F T

1. p ~p 2. ~p q 3. ~p ~q

4. (p ~q) (~p q)
5. (p q) (p q) 6. (p q) {(q p) (p q)}

3.4. Truth Tables for the Conditional & Biconditional


4. Use a truth table to determine if a compound statement is a tautology (: A compound statement that is always true) [(pq)~p]q

3.5. Equivalent Statements, Variations of Conditional Statements

Equivalent Statements ( p q ) : if they have the same truth value in every possible case

Variations of Conditional Statements: a. p q ~ q ~ p the contrapositive b. p q not q p the converse c. p q not ~ p ~ q the inverse

d. ~ (p q) is p ~ q

the negation

De Morgans Laws
a. b. ~ (p q) ~ p ~ q ~ (p q) ~ p ~ q

3.6. ARGUMENTS

Argument consists of 2 parts: 1. PREMISES: the given statements 2. CONCLUSION

An argument is valid if the conditional statement:

[(premise 1) (premise 2) (premise n)]


conclusion is a tautology

Anda mungkin juga menyukai