Scribd
Upload
46 views

Homework 6 Corrected

This document provides instructions for homework assignments in PHIL 150 that are due on November 6, 2018. It involves analyzing models in epistemic logic, checking whether sentences are true or false in the models, and proving properties about linear orders and Dedekind completeness using temporal logic axioms.

Uploaded by

qwention
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
46 views

Homework 6 Corrected

This document provides instructions for homework assignments in PHIL 150 that are due on November 6, 2018. It involves analyzing models in epistemic logic, checking whether sentences are true or false in the models, and proving properties about linear orders and Dedekind completeness using temporal logic axioms.

Uploaded by

qwention
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Homework 6

PHIL 150
due November 6, 2018

1. Consider the following model M in epistemic logic, with states r, s, t, and


u and agents 1, 2, and 3.
The agents’ accessibility relations are:

R1 = {hs, ti, hu, vi, hs, si, ht, ti, hu, ui, hv, vi}
R2 = {hs, ui, ht, vi, hs, si, ht, ti, hu, ui, hv, vi}
R3 = {ht, ui, hs, si, ht, ti, hu, ui, hv, vi}

All this information, together with some information about the valuation, is
depicted in the diagram below.
A, B
t

A, C s v D

u
B, C

Check whether the following sentences are true or false. Explain your rea-
soning.

(a) M, t  K 1 K 3 ¬D
(b) M, s  K 2 (B → K 1 ¬K 3 ¬B)
(c) M, u  K 1C ↔ K 2 B

1
2. Suppose that agent 3 announces ¬D, eliminating world v, to create a new
model M∗ .
A, B
t

A, C s

u
B, C

Check whether the following sentences are true or false. Explain your rea-
soning.

(a) M ∗ , t  K 1 K 3 ¬D
(b) M ∗ , s  K 2 (B → K 1 ¬K 3 ¬B)
(c) M ∗ , u  K 1C ↔ K 2 B

3. A relation < is linear iff two conditions hold:


C1. Whenever t < u and t < v, either (i) u = v or (ii) u < v or (ii) v < u.
C2. Whenever u < t and v < t, either (i) u = v or (ii) u < v or (ii) v < u.
Show that < is linear if and only if (T, <)  (FPA ∨ PFA) → (A ∨ PA ∨ FA).
*4 Extra Credit: The ordering on the real numbers (R, <) and the ordering
(Q, <) are both dense linear orderings, but they are not isomorophic. (R, <)
has, and (Q, <) lacks, the property of Dedekind completeness.
(T, <) is Dedikind complete if and only if every non-empty set of points
X ∈ T that has an upper bound (a point r such that t < r for all t ∈ X) has
a least upper bound (an upper bound r such that r < r0 for any other upper
bound r0 of X).
Perhaps surprisingly, there is a temporal logical axiom that expresses Dedekind
completeness. Suppose (T, <) is a linear order without endpoints. Show
(T, <) is Dedekind complete if and only if
(T, <)  ((HA → FHA) ∧ H(HA → FHA) ∧ G(HA → FHA)) → (HA → GA).

You might also like