Logic and Proof Flashcards

1
Q

What is a proposition

A

A declarative statement that is either true or false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what is this symbol ¬

A

p turns to ¬p
p = apple is red
¬p = apple is not red

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

what is a truth table

A

all combinations on the left side on the right side the connectives

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

what is this symbol ∧

A

conjunction
p∧q = T if both p and q are True.
Both propositions have to be true.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

what is this symbol ∨

A

disjunction
p ∨ q = T if p or q is true
one or more statements have to be true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

what is this symbol ∀

A

universal quantifier
for all x within the given domain satisfy a predicate to give true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

what is this symbol →

A

implication
if p then q or p implies q
hypothesis is true conclusion must be true for the implication to be true.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

what is one directional implication

A

in that case of p → q = T
where p = F and q = T, this is telling us the hypothesis is false so the implication will always be true
all numbers divisble by 4 are even
all even numbers arent divisible by 4

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

what is meant by converse

A

if p→q, the converse is q→p
switch the order.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

what is meant by inverse

A

if p→q the inverse would be ¬p→¬q
negate both propositions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

what is meant by contrapositive

A

if p→q the contrapositive would be ¬q→¬p
switch and negate

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

what is meat by biconditional

A

For a biconditional to be true both propositions must share the same truth value
p ↔ q = T if P = T and Q = T or P = F and Q = F

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

what is this symbol ↔

A

biconditional

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

how do you demonstrate equivalencies between different compound propisitions

A

truth tables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

where is the ↔ in the order of precedence

A

5

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

where is the ¬ in the order of precedence

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

where is the → in the order of precedence

A

4

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

where is the ∨ in the order of precedence

A

3

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

where is the ∧ in the order of precedence

20
Q

what is the definition of a negation

A

let p be a proposition, negation of p denoted by ¬p is the statement “it is not the case that p”

21
Q

What are the key feature of the negation operator

A
  • first in operator precedence
  • not systematically defined symbol
  • constructs new propositon based on an existing one
22
Q

Definition of AND

A

let p and q be propositions, conjunction of p and q denoted by p∧q, is the proposition “p and q”,
* only true when both propositions are true otherwise false

23
Q

What terminologies are utilised in natural language for the AND connective

A
  • but, when the propositions are related
  • it is sunny but it is raining , where the two predicates are seemingly unlikely to occur in the same situation or pose a seemingly paradoxical situation.
24
Q

What are key feature of the AND operator

A
  • 2nd in the order of precedence
  • only true when both conditions are true otherwise false
  • a connective, joining two propositions to form one
25
What is the definition for OR
let p and q be propositions, disjunction of p and q is denoted by p ∨ q , read as "p or q" * false when both propositions truth value is negative
26
key features of disjunction operator ∨
* 3rd in the order of precedence * true if either proposition is true * form new proposition based existing two that dont have to be distinct but would be pointless otherwise.
27
What is the inclusive OR
This is referred to as the inclusive disjunction, such that it would result in true if both or one of the propositions are met
28
What is an example of using the Inclusive OR
p : Students have taken calculus q : Students have taken introductory cs students who have taken calculus or introductory cs will take this class * here if the student has taken one or both they will be eligibile to take the cs class
29
What is the defintion of XOR
Let p and q be propositions, exclusive disjunction between p and q, p ⊕ q, is read as "p or q not both" or "p exc or q", only true when exactly one proposition is true otherwise false.
30
What is the definition of Implication
Let p and q be propositions, the conditional statement p→q is false when p is true and q is false otherwise is true
31
What is a good analogy to consider when thinking of the implication operator
You should think of this operator in the form of a pledge, consier the example if i win an election then i will lower tax. If i win election and i dont lower tax the pledge is broken. Otherwise it is possible i dont win an election and convince others to lower tax. If i dont win the election no one will expect me to lower tax hence this is still true.
32
in the statement p→q what is p and q
* P is the hypothesis, antedecent or premesis * Q is the conclusion, consequence implication
33
What are forms that the statement p→q appears in natural language
* "p is sufficient for q" * "p only if q" * "a sufficient condition for q is p" * "q is necessary for p"
34
Key features of implication operator
4th in order of precedence false if p is true and q is false
35
What is the distinction between mathematics and natural language often when utilising the implication operator
In mathematics it is not required to have a cause and effect relationship between the propositions being implied as we are only concerned with the truth values of the propositions mathematically. natural language would be superficially attached to the propositional objects.
36
what is a contrapositive statement of p→q equal to
it is equal to the original statement p→q
37
What is the converse of p→q equal to
the inverse
38
What is the inverse of p→q equal to
the converse
39
What is p→q equal to in terms of contrapositive, converse and inverse
contrapositive
40
What is the definition of bi-conditional
let p and q be propositions, the biconditional statement, p ↔ q, p if and only if q, only true if both proposition truth values are equal
41
What is this symbol ↔
Equivalence or bi conditional operator
42
What are uses for the biconditional operator in natural language
p if and only if q p is a necessary and sufficient condition for q
43
Feature of the biconditional operator
5th in the order of precedence true if both proposition truth values are the same equivalent to p→q ∧ q→p
44
What is meant by the implicit use of the biconditional operator
In the english language this is often implied such as if you eat your dinner then you can have dessert, we mean if you eat your dinner then and only then you may have dessert. having dinner is a necessary and sufficient condition of having dessert. no dinner no dessert. Hence the use of then and only then.
45
meaning of a bit
binary digit, that can have two possible states * term coined by john tukey, similarly termed software
46
bit string
a sequence of zero or more bits length of the string is the number of bits contained within it.
47
What operators can be perfomed on bit strings
OR, AND XOR