• 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

Vrije Universiteit Amsterdam, 2 June 2014, 18:30–21:15

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) Prove or disprove the validity of 232p → 3p in reflexive frames. (5 pt) (b) Prove or disprove the validity of p →32p in reflexive, transitive frames. (5 pt) (c) Is the formula 2p → 222p valid in transitive frames? Is it valid only in

transitive frames? Prove your answers. (7 pt)

(d) Show that the frame property ∀xy (Rxy → x = y ) is characterized by the

modal formula p →2p. (7 pt)

2. Consider the extension of the basic modal language with the ‘difference’ operator D whose semantics is given by:

M, s  Dϕ if and only if there exists t 6= s such that M, t  ϕ . Let F en G be the frames defined by the following pictures:

s t

F

s0

G

(a) Is the formula3p → Dp valid in F ? Explain your answer. (5 pt) (b) Is the formula3p → Dp valid in G ? Explain your answer. (5 pt) (c) Show that the formula3p → Dp characterizes irreflexivity. (7 pt) (d) Show that D is not definable in the basic modal language. (7 pt)

1

(2)

3. Consider the {a, b, c}-models A and B defined by:

k

` m

a a

b c

c

b p

A

u

v w

v0 w0

a b

c c

a

c c

b

b b p

p

B

(a) Define a relation E ⊆ {k, `, m} × {u, v, w, v0, w0} such that E : A, k ↔ B, u.

Show that E satisfies the forward condition (zig) of bisimulations. (8 pt) (b) Is there a formula which is true in state m but false in state w? Explain.

(4 pt) (c) Let bA be the PDL-extension of model A. Compute the transition relation bRπ

corresponding to the PDL-program π:

π = if p then (bc) else (a ∪ c) (8 pt) (d) Determine for each of the PDL-formulae hπip and [π]p whether it holds in bA.

(4 pt)

4. The Hilbert system T is the extension of the system K with the axiom of veridi- cality A1 (if something is known, it is true). System S4 is the extension of T with A2, the axiom of positive introspection. System S5 is the extension of S4 with A3, the axiom of negative introspection.

(a) Formulate the completeness theorem for the system S5. (3 pt) (b) Give a derivation or construct a countermodel:

(i) `T (K(p → q) ∧ p) → q (5 pt)

(ii) `S4¬KKp → K¬Kp (5 pt)

(iii) `S5¬KKp → K¬Kp (5 pt)

2

Referenties

GERELATEERDE DOCUMENTEN

[r]

macro \@wiledo; we use the counter \cifra to count and point to the position of a character and we cycle trough all the 16 fiscal code characters; on the first run when \cifra

Arguments: henv i:=#1 is the internal environment name, houtput namei:=#2 is its keyword to be used in the output, #3 is the running number, and #4 is the optional text argument in

It should be noted that any theorem set defined by \newtheorem is typeset in the \theoremstyle that is current at the time of the definition.. Thus,

In WEB a program is splitted into sections, every section contains a documentation and a program part (both parts can be empty).* Such a WEB program is transformed by the

Dysfunction of Purkinje cells, rather than cerebellar granule cell neurons, is the cause of the abnormal cerebellar morphology and ataxia seen in Ca V 2.1 α1 knockout mice.

What is the current situation of equity in the public transport system of Chicago and is there an influence of the red line extension and congestion pricing in this system..

Dit heeft met name te maken met de omvang van het aantal bedrij- ven met multifunctionele activiteiten, dat gezien de karakteristieken van de landbouw (kleinschalige bedrijven) en