Thms languages Sections AutomataTheory Doc

lang_eq Def L = M == l:Alph*. L(l) M(l)

Thm* Alph:Type{i}, L,M:LangOver(Alph). L = M Prop{i'}

iff Def P Q == (P Q) & (P Q)

Thm* A,B:Prop. (A B) Prop

lang_sing Def (l) == null(l)

Thm* Alph:Type. LangOver(Alph)

languages Def LangOver(Alph) == Alph*Prop

Thm* Alph:Type{i}. LangOver(Alph) Type{i'}

nat Def == {i:| 0i }

Thm* Type

rev_implies Def P Q == Q P

Thm* A,B:Prop. (A B) Prop

null Def null(as) == Case of as; nil true ; a.as' false

Thm* T:Type, as:T*. null(as)

Thm* null(nil)

assert Def b == if b True else False fi

Thm* b:. b Prop

le Def AB == B < A

Thm* i,j:. ij Prop

not Def A == A False

Thm* A:Prop. (A) Prop

About:
!abstractionimpliesfalseallpropmemberless_thanint
ifthenelsetrueboolassertlist_indbtruebfalseuniverse
listnilsetnatural_numberfunctionapplyand