P
A:Prop. Dec(A) 
Prop
} == {k:
| i 
k < j }m,n:. {m..n} Type
== {i:| 0i } Type
0
x,y. x = y T else x,y. 
z:T. (x R z) & (z R^n-1 y) fi
Def (recursive)
n:, T:Type, R:(T
TProp). R^n TTProp| Some definitions of interest. | |
| decidable | P |
| A:Prop. Dec(A) Prop | |
| int_seg | } == {k:| i k < j } |
| m,n:. {m..n} Type | |
| nat | == {i:| 0i } |
| Type | |
| rel_exp | 0 x,y. x = y T else x,y. z:T. (x R z) & (z R^n-1 y) fi
Def (recursive) |
| n:, T:Type, R:(TTProp). R^n TTProp |
About:
 |  |  |  |  |  |
 |  |  |  |  |  |
 |  |  |  |  |  |