Propositional Logic 1 Flashcards

Lesson 1 - Introduction to types of language, propositional logic, (including logical connectives/operators) propositional variables, propositional statements etc

1
Q

natural language

A

a language used for normal everyday communication

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

formal language

A

a set of strings of symbols formed from a finite alphabet and defined by specific rules

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

4 examples of rules that can be used to define formal languages

A

regular expressions, regular grammar, context-free grammar, context-sensitive grammar

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

natural language is inherently…?

A

ambiguous

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

premises

A

a proposition used in an argument to prove the truth of the conclusion

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

formal languages have no invalid…?

A

inferences

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

programming language

A

a formal constructed language designed to communicate instructions to a machine to control its behaviour

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

propositional logic is a type of…?

A

formal system

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

a formal system is a formal language equipped with a…?

A

consequence operation/deduction rule/inference rule

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

inference rules

A

logical tools used to draw conclusions from premises

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

inference rules form the foundation of…?

A

logical reasoning

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

propositional

A

a logical statement that can either be true or false but NOT both

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

atomic proposition

A

a logical statement that is either true or false (but not both) and cannot be broken down any further

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

compound propositions state…?

A

relationships between propositions

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

compound proposition

A

a proposition combining multiple propositions using logical connectives

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

defining languages involves at least…?

A

two languages

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

what are the two fundamental languages required for defining languages

A

the object language and the meta-language

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

object language

A

the language being defined

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

meta-language

A

the language used to define an object language

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

an object language has how many aspects?

A

2

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

aspects of an object language

A

its syntax and semantics

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

syntax

A

rules for writing an object language

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

semantics

A

the meanings of constructions in an object language

24
Q

defining syntax involves how many steps?

25
step 1 in defining syntax
defining the symbols
26
step 2 in defining syntax
defining larger constructions (e.g. sentences in NLs and formulae in propositional logic)
27
propositional variables represent...?
atomic propositions
28
names for propositional variables are often...?
abbreviations of the proposition
29
propositional variables tend to be...?
lower case
30
purpose of propositional connectives
form compound propositions from multiple simpler propositions
31
each logical connective has its own...?
semantics
32
p ∧ q 'p' and 'q' can be referred to as the...?
conjuncts
33
p ∨ q 'p' and 'q' can be referred to as the...?
disjuncts
34
law of excluded middle
for every proposition, either the proposition or its negation is true
35
why is the 'law of excluded middle' named as such?
every truth value is either true of false since there is no middle ground when it comes to the truth of a propositional formula
36
p ⇒ q is equivalent to...?
¬q ⇒ ¬p
37
¬q ⇒ ¬p is equivalent to...?
p ⇒ q
38
the contrapositive of p ⇒ q
¬q ⇒ ¬p
39
WFF stands for
well-formed formulae
40
law for equivalence
(p ⇒ q) ∧ (q ⇒ p)
41
number of steps in the process of logical deduction
3
42
step 1 in the process of logical deduction
identify the premises (true propositions)
43
step 2 in the process of logical deduction
construct and inference from the premises
44
step 3 in the process of logical deduction
give a conclusion
45
what is a conclusion
the process of giving some new proposition a truth value
46
if p and (p ⇒ q) are both true, then it can be inferred that...?
q is true as well
47
what is 'q if p' written using propositional logic?
p ⇒ q
48
what is 'q whenever p' written using propositional logic?
p ⇒ q
49
what is 'p only if q' written using propositional logic?
p ⇒ q
50
describe the equivalence law in words.
the conjuncts are proposition and its converse
51
p ⇒ ¬q is equivalent to
q ⇒ ¬p
52
technical term for ¬
negation
53
the law of the excluded middle is associated with which propositional connective?
disjunction
54
the process of defining syntax has how many step..?
2
55
what is the first step in defining syntax?
defining the basic symbols
56
what is the second step in defining syntax?
defining the rules for writing formulae with these symbols