• No results found

Exam Advanced Logic VU University Amsterdam, 25 March 2015, 15:15–18:00

N/A
N/A
Protected

Academic year: 2021

Share "Exam Advanced Logic VU University Amsterdam, 25 March 2015, 15:15–18:00"

Copied!
2
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Exam Advanced Logic

VU University Amsterdam, 25 March 2015, 15:15–18:00

This exam consists of four questions. Use of textbook, definition sheets, etc. is not allowed.

In total you can score 90 points as indicated per question. The final grade is the minimum of 10 and (points/10 + 1 + bonus).

1. (a) What frame property is characterized by the formula p ↔ 2p ? Prove your

answer. (10 pt)

(b) Show that q ↔3q characterizes the same frame property. (Note that for this you do not have to know the frame property asked for in (a).) (10 pt)

2. (a) Show that the formula23p → 2323p is valid on all transitive frames.(10 pt) (b) Is the formula23p → 2323p only valid on transitive frames? Prove your

answer. (10 pt)

3. System S5 is the extension of system K with the truth axiom (if something is known, it is true), the axiom of positive introspection, and the axiom of negative introspection.

(a) Show that p → K¬K¬p is a theorem of S5 . (10 pt) (b) Show that the following rule is admissible in S5 :

ϕ → Kψ

¬K¬ϕ → ψ (10 pt)

1

(2)

4. Consider the following {a, b}-frames F1 and F2:

X

Y Z

b a a

b

a b

A

B C

D

a b

a

b

a

b a

b

F1 F2

(a) Explain why in all models on these frames, the meanings of hiiϕ and [i]ϕ coincide for i ∈ {a, b}. That is, explain why in all models M on a frame F ∈ {F1, F2} for each label i ∈ {a, b}, for all states s, and for all formulas ϕ it holds: M, s  [i]ϕ ⇐⇒ M, s  hiiϕ. (An informal proof suffices.) (5 pt) (b) Draw the first three levels of the tree unravelling (or unfolding) of F2 taking

state A as root node. (5 pt)

Now consider the models M1 = (F1, V1) and M2 = (F2, V2) where V1(p) = {Z}

and V2(p) = {C, D}, and V1(q) = V2(q) = ∅ for all propositional variables q 6= p.

(c) If possible, give a multi-modal formula over the index set {a, b} that distin- guishes state Y of M1 from state A of M2. Otherwise, prove that there is no

such formula. (10 pt)

The following question is about propositional dynamic logic (PDL).

(d) Prove that p ↔ [a(bb)]p is globally true in the PDL-extension of M1. (10 pt)

2

Referenties

GERELATEERDE DOCUMENTEN

(Give your answer in terms of the notion of truth of a formula in a point of a model.) (4 pt) (b) Prove that the formula 23p → 2323p is valid in all transitive frames.. (8 pt) (c)

System T is the extension of the minimal modal logic K with the axiom of veridi- cality (if something is known, it

(Alternatively we can show that the formula is valid in all frames (W, R), where R is an equivalence relation, and use the completeness theorem for system S5 to conclude that

Add the Shavit-Francez termination detection algorithm on top of the basic al- gorithm, and extend this basic computation with control messages, to show how.. termination

Compute the clustering coefficients of each of the vertices in the graph from exercise 2, as well as the clustering coefficient of the entire graph... Up to now the graph has been

Build an Euler tour in this graph, starting in vertex u, in two ways:. (a) Apply Fleury’s algorithm, whereby you explain step by step which

Bereken de flux van F door K met behulp van

Zo nee: verklaar waarom niet, zo ja:.. vind