Week 2 Flashcards

1
Q

What do you need to define a language?

A

An alphabet.
Rules which govern the syntax, the ordering of the
elements.
Semantic interpretation, the assignment of meaning to
well-formed sentences

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

Distinguish between a sentence and a sequence of words.

A

Every sentence is a sequence of words but not every sequence of words is a sentence. A sentence is always grammatically correct.

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

What are identifiers?

A

Symbols for denoting propositions. E.g. A, B, C

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

What is the punctuation symbol for logic?

A

( and )

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

What are propositional connectives? Name them.

A

Elementary operators that join identifiers/propositions E.g. ¬, ^, v, => and <=>.

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

What are regular formulae?

A

Formula that use the alphabet of the given language.

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

Is an identifier a proposition on it’s own?

A

Yes.

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

What are well formed formulae?

A

A well-formed formula is a formula that uses only the alphabet of the language and obeys the grammatical rules given in the syntax of the language.

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

Acronym for precedence of propositional connectives.

A

B - Brackets
N - Negation
C - Conjunction
D - Disjunction
I - Implies
E - Equivalence

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

What are the semantics?

A

Semantics deal with the meaning of compound
propositions.

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

Full truth table layout for prime proposition.

A

T(2) T(P) T(Q) F(2)
P = T = T = F = F
Q = T = F = T = F
NP = F = F = T = T
C = T = F = F = F
D = T = T = T = F
I = T = F = T = T
E = T = F = F = T

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

What does -> mean in the rules of a language?

A

Can be (defines grammar rules (syntax) )

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

What do * and ? mean in terms of sentences in logic?

A

There is something wrong.

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

What are the three characteristics of a defined alphabet?

A

Symbols for denoting propositions.
Punctuation symbols.
Propositional Connectives

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