Michaelmas Flashcards

1
Q

What does Alethic mean?

A

Concerning possibility and necessity

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

What does decidable mean?

A

A formal language is decidable if there is an effective procedure to check if a sentence is logically valid in that language

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

What is an effective procedure?

A

A finite number of exact instructions that always terminates with the right answer in a finite number of steps

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

What does valid mean?

A

it is true on every assignment of truth values to the
atomic propositions

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

What does inconsistent mean?

A

it is false on every assignment of truth values to the atomic propositions.

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

When is a wff is satisfiable?

A

A wff is satisfiable if there is a model and world where it is true. A satisfiable
wff is also called consistent.

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

What is an evaluation function?

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

Give the semantics of possibility and necessity

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

On what frames is neccessary p implies p valid

A

Reflexive

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

Define reflexive

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

Define irreflexive

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

Define Serial

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

Define backwards linear

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

Define a pre order

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

Define an equivalence relation

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

State the axioms of K

A
17
Q

Describe system T

A
18
Q

Describe system D

A
19
Q

Describe S4

A
20
Q

Describe S5

A
21
Q

Give an alternative description of S5

A
22
Q

State which frame classes relate to which axiom

A
23
Q

Define the modal evaluation game

A
24
Q

Give the key lemma for the modal evaluation game

A
25
Q

Define a bisimulation

A
26
Q

Define a tree unravelling

A
27
Q

Define modal depth

A
28
Q

Define Chop

A
29
Q

Define prune

A
30
Q

Give the effective procedure for checking validity

A