| Some definitions of interest. |
|
d-feasible | Def d-feasible(D)
Def == ( i:Id. Feasible(M(i)))
Def == & ( l:IdLnk, tg:Id.
Def == & (M(source(l)).dout(l,tg) r M(destination(l)).din(l,tg))
Def == & ( i:Id.
Def == & (finite-type({l:IdLnk
Def == & (finite-type({| destination(l) = i & M(source(l)) sends on link l })) |
|
ma-join-list | Def (L) == reduce( A,B. A B;;L) |
|
Knd | Def Knd == (IdLnk Id)+Id |
| | Thm* Knd Type |
|
Id | Def Id == Atom  |
| | Thm* Id Type |
|
recognizer1 | Def recognizer1(loc;T;A;P;k;i;r;x)
Def == if loc = i
Def == if [r : initially r = false ;
Def == if [only members of [k] affect r : ;
Def == if [ma-single-effect1(r; ;x;A;k;T; r,x,v. P(x,v)  r)]
Def == else nil fi |
| | Thm* loc:Id, T,A:Type, P:(A T  ), k:Knd, i,r,x:Id.
Thm* A  T  x = r  recognizer1(loc;T;A;P;k;i;r;x) MsgA List |
|
not | Def A == A  False |
| | Thm* A:Prop. ( A) Prop |