| author | wenzelm | 
| Sun, 25 May 2014 17:08:46 +0200 | |
| changeset 57086 | db7c735e963d | 
| parent 54742 | 7a86358a3c0b | 
| child 60770 | 240563fbf41d | 
| permissions | -rw-r--r-- | 
| 35762 | 1 | (* Title: Sequents/T.thy | 
| 2073 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 2 | Author: Martin Coen | 
| 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 3 | Copyright 1991 University of Cambridge | 
| 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 4 | *) | 
| 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 5 | |
| 17481 | 6 | theory T | 
| 7 | imports Modal0 | |
| 8 | begin | |
| 9 | ||
| 51309 | 10 | axiomatization where | 
| 2073 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 11 | (* Definition of the star operation using a set of Horn clauses *) | 
| 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 12 | (* For system T:  gamma * == {P | []P : gamma}                  *)
 | 
| 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 13 | (*                delta * == {P | <>P : delta}                  *)
 | 
| 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 14 | |
| 51309 | 15 | lstar0: "|L>" and | 
| 16 | lstar1: "$G |L> $H ==> []P, $G |L> P, $H" and | |
| 17 | lstar2: "$G |L> $H ==> P, $G |L> $H" and | |
| 18 | rstar0: "|R>" and | |
| 19 | rstar1: "$G |R> $H ==> <>P, $G |R> P, $H" and | |
| 20 | rstar2: "$G |R> $H ==> P, $G |R> $H" and | |
| 2073 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 21 | |
| 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 22 | (* Rules for [] and <> *) | 
| 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 23 | |
| 17481 | 24 | boxR: | 
| 25 | "[| $E |L> $E'; $F |R> $F'; $G |R> $G'; | |
| 51309 | 26 | $E' |- $F', P, $G'|] ==> $E |- $F, []P, $G" and | 
| 27 | boxL: "$E, P, $F |- $G ==> $E, []P, $F |- $G" and | |
| 28 | diaR: "$E |- $F, P, $G ==> $E |- $F, <>P, $G" and | |
| 17481 | 29 | diaL: | 
| 30 | "[| $E |L> $E'; $F |L> $F'; $G |R> $G'; | |
| 2073 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 31 | $E', P, $F'|- $G'|] ==> $E, <>P, $F |- $G" | 
| 17481 | 32 | |
| 21426 | 33 | ML {*
 | 
| 34 | structure T_Prover = Modal_ProverFun | |
| 35 | ( | |
| 39159 | 36 |   val rewrite_rls = @{thms rewrite_rls}
 | 
| 37 |   val safe_rls = @{thms safe_rls}
 | |
| 38 |   val unsafe_rls = @{thms unsafe_rls} @ [@{thm boxR}, @{thm diaL}]
 | |
| 39 |   val bound_rls = @{thms bound_rls} @ [@{thm boxL}, @{thm diaR}]
 | |
| 40 |   val aside_rls = [@{thm lstar0}, @{thm lstar1}, @{thm lstar2}, @{thm rstar0},
 | |
| 41 |     @{thm rstar1}, @{thm rstar2}]
 | |
| 21426 | 42 | ) | 
| 43 | *} | |
| 44 | ||
| 54742 
7a86358a3c0b
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
 wenzelm parents: 
51309diff
changeset | 45 | method_setup T_solve = {* Scan.succeed (fn ctxt => SIMPLE_METHOD (T_Prover.solve_tac ctxt 2)) *}
 | 
| 21426 | 46 | |
| 47 | ||
| 48 | (* Theorems of system T from Hughes and Cresswell and Hailpern, LNCS 129 *) | |
| 49 | ||
| 50 | lemma "|- []P --> P" by T_solve | |
| 51 | lemma "|- [](P-->Q) --> ([]P-->[]Q)" by T_solve (* normality*) | |
| 52 | lemma "|- (P--<Q) --> []P --> []Q" by T_solve | |
| 53 | lemma "|- P --> <>P" by T_solve | |
| 54 | ||
| 55 | lemma "|- [](P & Q) <-> []P & []Q" by T_solve | |
| 56 | lemma "|- <>(P | Q) <-> <>P | <>Q" by T_solve | |
| 57 | lemma "|- [](P<->Q) <-> (P>-<Q)" by T_solve | |
| 58 | lemma "|- <>(P-->Q) <-> ([]P--><>Q)" by T_solve | |
| 59 | lemma "|- []P <-> ~<>(~P)" by T_solve | |
| 60 | lemma "|- [](~P) <-> ~<>P" by T_solve | |
| 61 | lemma "|- ~[]P <-> <>(~P)" by T_solve | |
| 62 | lemma "|- [][]P <-> ~<><>(~P)" by T_solve | |
| 63 | lemma "|- ~<>(P | Q) <-> ~<>P & ~<>Q" by T_solve | |
| 64 | ||
| 65 | lemma "|- []P | []Q --> [](P | Q)" by T_solve | |
| 66 | lemma "|- <>(P & Q) --> <>P & <>Q" by T_solve | |
| 67 | lemma "|- [](P | Q) --> []P | <>Q" by T_solve | |
| 68 | lemma "|- <>P & []Q --> <>(P & Q)" by T_solve | |
| 69 | lemma "|- [](P | Q) --> <>P | []Q" by T_solve | |
| 70 | lemma "|- <>(P-->(Q & R)) --> ([]P --> <>Q) & ([]P--><>R)" by T_solve | |
| 71 | lemma "|- (P--<Q) & (Q--<R) --> (P--<R)" by T_solve | |
| 72 | lemma "|- []P --> <>Q --> <>(P & Q)" by T_solve | |
| 17481 | 73 | |
| 2073 
fb0655539d05
New unified treatment of sequent calculi by Sara Kalvala
 paulson parents: diff
changeset | 74 | end |