A Proof of Theorem 4

!
T |=
Kn
¬( &∈w & ∧ ϕi ), and then w ∈ / W, a contradiction.
!
Let Φ be a law, M ! ∈ M!Φ , and let T !Φ be the output of our Hence Ra (w) #= ∅.
algorithms on input theory T and law Φ. Finally, let Φ be of the form ϕ → %a&*, for some ϕ ∈ F.
M Then M ! = %W! , R! & for some M = %W, R& ∈ M s.t. W! =
If T ∪ {Φ} #|=
Kn
⊥, then M ! ∈ M \ {M :#|= Φ} and M ! is W and R! = R ∪ Rϕ,' , with
a
!
a model of T Φ = T ∪ {Φ}.
Rϕ,'
a = {(w, w! ) : w! ∈ rt(w, ϕ → %a&*, M , M)}
Let T ∪ {Φ} |=
K
⊥. We analyze each case.
n
such that R! is minimal!w.r.t. R.
! !
Let Φ be some ϕ ∈ F. Then M = %W , R & where W =! ! M M!
From W! = W, |= S . As R ⊆ R! , |= X . As far as
(W \ val(¬ϕ)) ∪ val(ϕ) is minimal w.r.t. W and R! ⊆ R is S ∪ X ⊆ T !ϕ→$a%' , it is enough to show that M ! satisfies the
maximal w.r.t. R, for some M = %W, R& ∈ M. added laws.
As we have assumed the syntactical classical revision oper- M! M!
By definition, |= ϕ → %a&*, and then |= (π ∧ ϕA ) →
ator # is sound and complete w.r.t. its semantics and is more- %a&* for every π ∈ IP(S ∧ ϕ).
M! M!
over minimal, we have |= S # ϕ. Because R! ⊆ R, |= E . !
"
If (ϕi ∧ π ∧ ϕA ) → [a](ψi ∨ π ! ∈IP(S ) (π ∧ ϕA )) ∈
!

Thus it is enough to show that M ! is a model of the added A! ⊆atm(π ! )

laws. T !ϕ→$a%' , then for every w ∈ W! , if w ! ϕi ∧ π ∧ ϕA , then

Given (ϕi ∧ π ∧ ϕA ) → %a&* ∈ T !ϕ , for every w ∈ W! , if M
w ! ϕi . Because |= ϕi → [a]ψi , we have |= ψ for all
M
M! w! i
!
|=
w
ϕi ∧ π ∧ ϕA , then w ∈ W (because S #|=
CPL
(π ∧ ϕA ) → ⊥). w! ∈ W s.t. (w, w! ) ∈ Ra , and then |=
M
ψi for every w! ∈ W!
w!
From w ! ϕi and ϕi → %a&* ∈ Xa , we have Ra (w) #= ∅.
M! s.t. (w, w! ) ∈ R!a \ Rϕ,' a . Now, given (w, w! ) ∈ Rϕ,' a , we
Suppose R!a (w) = ∅. As |= S # ϕ ∪ E and R! is maximal, M!" !
M !! have |=w!
!
π ∈IP(S ) (π ∧ ϕA ! ), and the result follows.
every M !! = %W!! , R!! & s.t. |= S # ϕ ∪ E is s.t. R!!a (w) = ∅, A! ⊆atm(π
! !)
and then S # ϕ ∪ E |= Kn
(π ∧ ϕA ) → [a]⊥. Because T |= Kn
Let (ϕi ∧ T|= (π∧ϕA )→[a]⊥ ¬(π ∧ ϕA )) → [a]ψi ∈
Kn
(π ∧ ϕA ) → %a&*, and S #|= (π ∧ ϕA ) → ⊥ and S # ϕ #|= M!
CPL CPL T !ϕ→$a%' . For every w ∈ W! , if |= ϕi ∧
(π ∧ ϕA ) → ⊥, we get S # ϕ, E , X |= Kn
¬(π ∧ ϕA ), and ! w
M
then (ϕi ∧ π ∧ ϕA ) → %a&* ∈ / T ϕ . Hence R!a (w) #= ∅, and
! T|= (π∧ϕA )→[a]⊥ ¬(π ∧ ϕA ), then w ! ϕi , and as |= ϕi →
Kn
M! M
|= (ϕi ∧ π ∧ ϕA ) → %a&*. [a]ψi , we have |= ψ for all w! ∈ W s.t. (w, w! ) ∈ Ra . Thus
w! i
If (π ∧ ϕA ) → [a]⊥ ∈ T !ϕ , then S |=
CPL
(π ∧ ϕA ) → ⊥. M!
|= ψi for every w! ∈ W! s.t. (w, w! ) ∈ R!a \ Rϕ,' . Now,
w! a
M!
Thus, for every w ∈ W! , if |=
w
π ∧ ϕA , R!a (w) = ∅ and the if w #! ϕ, then Rϕ,'a = ∅ and the result follows. Other-
result follows. wise, if w ! ϕ, then T #|= K
(π ∧ ϕA ) → [a]⊥, and then
! n

Let Φ now have the form ϕ → [a]ψ, for ϕ, ψ ∈ F. Then (ϕi ∧ T|= (π∧ϕA )→[a]⊥ ¬(π ∧ ϕA )) → [a]ψi has not been put
Kn
M! = %W! , R! & for some M = %W, R& ∈ M s.t. W! = W and in T !ϕ→$a%' , a contradiction.
R! ⊆ R, where R! is maximal w.r.t. R.
M! M!
Let now (π ∧ ϕA ∧ &) → [a]& ∈ T !ϕ→$a%' . For every w ∈
From W! = W, |= S . As R! ⊆ R, |= E . Because S ∪E ⊆ M! M! M
!
T ϕ→[a]ψ , it suffices to show that M ! is a model of the added W! , if |=
w
π ∧ ϕA ∧ &, then |=
w
&, and then |=
w
&. From
laws. (π ∧ ϕA ∧ &) → [a]& ∈ T !ϕ→$a%' , we have T |=Kn
& → [a]⊥
M! M! or T #|= & → [a]¬& and T |= & → [a]&. In both cases,
By definition, |= ϕ → [a]ψ, and then |= (π∧ϕA ) → [a]ψ K n K n
for every π ∈ IP(S ∧ ϕ). M M!
|= & for every w! ∈ Ra (w), and then |= & for every w! s.t.
If (ϕi ∧π∧ϕA ) → %a&* ∈ T !ϕ→[a]ψ , then for every w ∈ W! , w! w!
M!
if w ! ϕi ∧ π ∧ ϕA , we have w ! ϕi . As w ∈ W, and ϕi → (w, w! ) ∈ R! \ Rϕ,'
a . It remains to show that |=
w!
& for every
%a&* ∈ Xa , Ra (w) = ∅. If R!a (w) = ∅, then w! ! ¬ψ for ! ! !
w ∈ W s.t. (w, w ) ∈ Ra . ϕ,'
every w! ∈ Ra (w). Thus as far as we added (π ∧ ϕA ) → [a]ψ M!
Suppose #|= &. Then ¬& ∈ w! \w. From the construction of
to T !ϕ→[a]ψ , we must have T !ϕ→[a]ψ |= Kn
(π ∧ ϕA ) → [a]⊥. w!
M ! , there is M !! = %W!! , R!! & ∈ M s.t. there is (u, v) ∈ R!!a
Hence R!a (w) ! #= ∅. M !! M !!
Let (ϕi ∧ T|= (π∧ϕA )→$a%¬ψ ¬(π ∧ ϕA )) → %a&* ∈ and ¬& ∈ v \ u, i.e., |=
u
& and |=
v
¬&. From (u, v) ∈ R!!a , we
Kn M !!
! M! do not have T |= & → [a]⊥. From |= ¬&, we do not have
T !ϕ→[a]ψ . For every w ∈ W , if |= w
ϕi ∧ Kn v
! T |= & → [a]&. Thus the algorithm has not put (π ∧ϕA ∧&) →
T|= (π∧ϕA )→$a%¬ψ ¬(π ∧ ϕA ), then w ! ϕi , and as w ∈W Kn
Kn [a]& in T !ϕ→$a%' , a contradiction.
and ϕi → %a&* ∈ Xa , we have Ra (w) #= ∅. If R!a (w) = ∅, be-
M!
cause |= S ∧E and R! is maximal, every M !! = %W!! , R!! & s.t. B Proof of Theorem 5
M !!
|= S ∧ E is s.t. R!!a (w) = ∅. Then S , E |=
!
K n &∈w & → [a]⊥. Definition 13 T is modular if and only if M = {M :
M is a supra-model of T} =
# ∅.
!
But then T |=
K &∈w & → [a]⊥, and as ϕ i → %a&* ∈ Xa ,
n
Lemma 1 Let Φ be a law. If T is modular and T ∪{Φ} |=
Kn
⊥, Lemma 3 Let T be modular, and Φ be a law. Then T |=
K
Φ
n
!
then T Φ is modular. if and only if every M ! = %val(S ), R! & such that |=
$W,R%
T and
Proof: Let Φ be nonclassical. Suppose T !Φ is not modular. R ⊆ R! is a model of Φ.
Then there is ϕ! ∈ F s.t. T !ϕ |= Kn
ϕ! and S ! #|=
CPL
ϕ! , where S ! Proof:
! ! M
is static laws in T Φ . Suppose T #|= Kn
ϕ . Then we must have (⇒): Straightforward, as T |=
K
Φ implies |= Φ for every M
n
T !Φ |=Kn
¬ϕ !
→ [a]⊥ and T !
Φ Kn|= ¬ϕ !
→ %a&*. M
such that |= T, in particular for those that are extensions of
Suppose Φ has the form ϕ → [a]ψ, for ϕ, ψ ∈ F. Then some model of T.
for all ϕ ∧ ¬ϕ! -contexts, as far as T !Φ |= Kn
(ϕ ∧ ¬ϕ! ) → [a]⊥,
(ϕ ∧ ¬ϕ! ) → %a&* ∈ / T !Φ . Then T !Φ |= ϕ! if and only if (⇐): Suppose T #|=
K
Φ. Then there is M = %W, R& such
Kn n
! ! M M
S |= CPL
ϕ , a contradiction. that |= T and #|= Φ. As T is modular, the big model Mbig =
Suppose Φ is of the form ϕ → %a&*, for ϕ ∈ F. Then for %Wbig , Rbig & of T is a model of T. Then by Lemma 2 there
all ϕ ∧ ¬ϕ! -contexts such that T !Φ |= (ϕ ∧ ¬ϕ! ) → %a&*, is a minimal extension R! of R w.r.t. Rbig such that M ! =
Kn M
!
T Φ |= (ϕ ∧ ¬ϕ ) → [a]⊥ is impossible as far as Ea− has
! %val(S ), R ∪ R! & is a model of T. Because #|= Φ, there is
Kn M
been weakened. Then T !Φ |= Kn
ϕ! if and only if S ! |= CPL
ϕ! , a w ∈ W such that #|= w
Φ. If Φ is some ϕ ∈ F or an effect law,
contradiction. M!
any extension M ! of M is such that #|= Φ. If Φ is of the form
Hence we have T |= Kn
ϕ! . Because Φ is nonclassical, S ! = M
w

! ϕ → %a&*, then |= ϕ and Ra (w) = ∅. As any extension of

S . Then T |= ϕ and S #|= ϕ! , and hence T is not modular. w
K
n CPL
M is such that (u, v) ∈ R! if and only if u ∈ val(S ) \ W, only
Let now Φ be some ϕ ∈ F. Suppose T !ϕ is not modular, worlds other than those in W get a new leaving arrow. Thus
M!
i.e., there is ϕ!! ∈ F s.t. T !ϕ |=
K
ϕ!! and S ! = S # ϕ #|=
CPL
ϕ!! . (R ∪ R! )a (w) = ∅, and then #|= Φ.
n w
From S ! #|= ϕ!! , there is v ∈ val(S ! ) s.t. v !
# ϕ!! .
CPL
!! Lemma 4 Let T be modular and Φ a law. If M ! =
If v ∈ val(S ), as T is modular, T*|= ϕ . From this and M
Kn %val(S ! ), R! & is a model of T !Φ , then there is M = {M :|= T}
T !ϕ |= Kn
ϕ!! , we must have T !ϕ |= Kn
¬ϕ!! → [a]⊥ and T !ϕ |=
Kn
!
s.t. M ∈ MΦ . !
!!
¬ϕ → %a&*. From the latter, we get T |= ¬ϕ!! → %a&*,
Kn M! M!
and from the first we have T |= ¬ϕ!! → [a]⊥. Putting both Proof: Let M ! = %val(S ! ), R! & be such that |= T !Φ . If |= T,
Kn M !
!!
results together we get T |= Kn
ϕ . As S #|=
CPL
ϕ!! , we have a the result follows. Suppose #|= T. We analyze each case.
contradiction. Let Φ be of the form ϕ → [a]ψ, for ϕ, ψ ∈ F. Let M =
If v ∈/ val(S ), then T !ϕ #|= ¬ϕ!! → %a&*, as no executabil- {M : M = %val(S ), R&}. As T is modular, by Lemmas 2
Kn
and 3, M is non-empty and contains only models of T.
ity for context ¬ϕ has been put into T !ϕ . Hence T !ϕ #|=
!!
ϕ!! ,
Kn Suppose M ! is not a minimal model of T !ϕ→[a]ψ , i.e., there
a contradiction.
is M !! such that M !! /M M ! for some M ∈ M. Then
Lemma 2 If Mbig = %Wbig , Rbig & is a model of T, then M ! and M !! differ only in the effect of a in a given ϕ-world,
M viz. a π ∧ ϕA -context, for some π ∈ IP(S ∧ ϕ) and ϕA =
for every M = %W, R& such that |= T there is a mini- ! !
!
mal (w.r.t. set inclusion) extension R ⊆ Rbig \ R such that p ∧ pi ∈atm(π) ¬pi such that A ⊆ atm(π).
pi ∈atm(π) i
pi ∈A pi ∈A
/
M ! = %val(S ), R ∪ R! & is a model of T. M! M !!
Because #|= (π ∧ ϕA ) → %a&¬ψ, we must have |=
Proof: Let Mbig = %Wbig , Rbig & be a model of T, and let M = M !!
(π ∧ ϕA ) → %a&¬ψ, and then #|= ϕ → [a]ψ. Hence M !
M
%W, R& be such that |= T. Consider M ! = %val(S ), R&. If is minimal w.r.t. /M .
M! When revising by an effect law, S ! = S . Hence tak-
|= T, we have R! = ∅ ⊆ Rbig \ R that is minimal. Suppose
M! ing the right R and Rϕ,¬ψ such that M = %val(S ), R& and
then #|= T. We extend M ! to a model of T that is a minimal ! ϕ,¬ψ
a
M M
M! R = R \ Ra , for some Rϕ,¬ψ
a ⊆ {(w, w! ) :|= ϕ, |=
extension of M . As #|= T, there is v ∈ val(S ) \ W such that w w!
M! M! ¬ψ and (w, w! ) ∈ Ra }, we have M ∈ M and then M ! ∈
#|=
v
T. Then there is Φ ∈ T such that #|=v
Φ. If Φ is some M!ϕ→[a]ψ .
ϕ ∈ F, as v ∈ Wbig , Mbig is not a model of T. If Φ is of the Let Φ have the form ϕ → %a&*, for ϕ ∈ F. Let M =
form ϕ → [a]ψ, for ϕ, ψ ∈ F, there is v! ∈ val(S ) such that {M : M = %val(S ), R&}. As T is modular, by Lemmas 2
(v, v! ) ∈ Ra and v! #! ψ, a contradiction since Ra (v) = ∅. and 3, M is non-empty and contains only models of T.
Let now Φ have the form ϕ → %a&* for some ϕ ∈ F. Then Suppose that M ! is not a minimal model of T !ϕ→$a%' , i.e.,
M! M
big M
|= ϕ. As v ∈ Wbig , if #|= ϕ → %a&*, then #|= big T. Hence, M !!
v v there is M !! such that |= T !ϕ→$a%' and M !! /M M ! for
Rbig a (v) #= ∅. Thus taking any (v, v! ) ∈ Rbig a gives us a some M ∈ M. Then M ! and M !! differ only on the exe-
minimal R! = {(v, v! )} such that M !! = %val(S ), R ∪ R! & is a
model of T. ! i.e., a π ∧ ϕ!
cutability of a in a given ϕ-world, A -context, for
some π ∈ IP(S ∧ ϕ) and ϕA = pi ∈atm(π) pi ∧ pi ∈atm(π) ¬pi ,
pi ∈A pi ∈A
/
such that A ⊆ atm(π). This means M !! has no arrow leaving
M !!
this π ∧ ϕA -world. Then |= (π ∧ ϕA ) → [a]⊥, and hence
!!
M
#|= ϕ → %a&*. Hence M is a minimal model of T !ϕ→$a%'
!

w.r.t. /M .
When revising by executability laws, S ! = S . Thus taking
the right R and a minimal Rϕ,' a such that M = %val(S ), R&
M
and R! = R ∪ Rϕ,' a , for some Rϕ,'
a ⊆ {(w, w! ) :|= w
ϕ and w! ∈ rt(w, ϕ → %a&*, M , M)}, we get M ∈ M and
then M ! ∈ M!ϕ→$a%' .
Finally, let Φ be some ϕ ∈ F. Then M ! is such that for
every w ∈ W! , if R!a (w) #= ∅, then w ∈ val(S ) and Ra (w) #= ∅
for every M = %W, R& ∈ M. Choosing the right M ∈ M
the result follows.

Proof of Theorem 5
Let T !Φ be the output of our algorithms on input theory T
and law Φ. If T !Φ = T ∪ {Φ}, then T ∪ {Φ} #|=
K
⊥, and hence
n
M! M
every M ! such that |= T !Φ is such that M ! ∈ M \ {M :#|=
Φ} and the result follows.
Suppose T∪{Φ} |= Kn
⊥. From the hypothesis that T is mod-
ular and Lemma 1, T ! is modular. Then M ! = %val(S ! ), R&
is a model of T ! , by Lemma 2. From this and Lemma 3 the
result follows.