• No results found

Exam Advanced Logic

N/A
N/A
Protected

Academic year: 2021

Share "Exam Advanced Logic"

Copied!
2
0
0

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

Hele tekst

(1)

Exam Advanced Logic

VU University Amsterdam, 1 June 2015, 18:30–21:15

This exam consists of four questions. 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) Show that the formula 2p → 323p is valid on all reflexive frames. (8 pt) (b) Is the formula 2p → 323p valid only on reflexive frames? Motivate your

answer. (8 pt)

(c) What frame property is characterised by the formula 2p ∨ 2¬p ? Give a formal definition of the property, and prove the characterisation. (8 pt)

2. Consider the frames A and B defined for the language with modal operators hai and hbi defined by A = (WA, RAa, RAb ) and B = (WB, RBa, RBb), where

WA = {s, t} WB = N = {0, 1, 2, . . .}

RAa = {(s, t)} RaB = {(2n, 2n + 1) | n ∈ N}

RAb = {(t, s)} RbB = {(2n + 1, 2n + 2) | n ∈ N} .

(a) If possible, give a formula valid in A but not in B, and prove both facts.

Otherwise, explain why such a formula does not exist. (8 pt) (b) Same question as 2 (a) but now with the roles of A and B interchanged. (8 pt) Consider the valuations VA and VB defined on the respective frames A and B by

VA(p) = {s} VB(p) = {2n | n ∈ N} .

(c) Show that state s of the model (A, VA) is bisimilar to state 42 of the model

(B, VB). (8 pt)

1

(2)

3. Consider the models M and N defined by:

s

t

u

b a

b a

p

M

n1

n2 n3

n4 n5

a

b a

b

a b b a

p p

N

(a) Show that there is no modal formula distinguishing state n3 in model N from

state t in model M . (8 pt)

(b) Let bN be the PDL-extension of model N . Compute the transition relation Rbβ corresponding to the PDL-program β = while p do abba. (8 pt) (c) Determine whether the PDL-formula [β]p ↔ p globally holds in bN . Prove

your answer. (6 pt)

4. The Hilbert system for the logic S5 is the extension of the Hilbert system for the basic modal logic K with A1: the truth axiom (if something is known, it is true), A2: the axiom of positive introspection, and A3: the axiom of negative introspection.

(a) Prove that every reflexive and Euclidean relation is transitive. How can this be used to show that A2 follows from A1 and A3 ? (7 pt) (b) Formulate the completeness theorem for S5. (5 pt) (c) Show that ¬K¬(p ∧ Kq) ↔ (¬K¬p ∧ Kq) is a theorem of S5. (For this you

may use your answer to 4 (b).) (8 pt)

2

Referenties

GERELATEERDE DOCUMENTEN

In conclusion, the process of remediation in Slumdog Millionaire does not only use the strategy of “immediacy,” but also the other strategy in the double logic of remediation,

Verschillende planten werden mogelijk uit het wild verzameld en voor hun geneeskrachtige werking gebruikt. Zo zijn de bessen van kruidvlier niet geschikt om rauw te eten, maar

(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

De balans gaf niet alleen een overzicht van de ontwikkeling in het aantal verkeersslachtoffers in deze periode, maar bekeek ook hoe de factoren die van invloed zijn op

Treating states as primitive and treating program variables as functions from states to values thus allows us to have many different types of things that can be stored as the value

At each point in the text the reader may be thought to be in a certain contextual state; 6 in each contextual state items like reference time, speaker, addressee, various

The authors propose that an autonomous parental attachment representation will more likely lead to responsive interactions with the infant than will an insecure one; in the latter