Thu, 24 Nov 1994 00:32:43 +0100 moved version of Cantors theorem to ZF/Perm.ML
lcp [Thu, 24 Nov 1994 00:32:43 +0100] rev 735
moved version of Cantors theorem to ZF/Perm.ML
Thu, 24 Nov 1994 00:32:12 +0100 ZF INDUCTIVE DEFINITIONS: Simplifying the type checking for mutually
lcp [Thu, 24 Nov 1994 00:32:12 +0100] rev 734
ZF INDUCTIVE DEFINITIONS: Simplifying the type checking for mutually recursive datatypes, especially with monotone operators Inductive_Fun,CoInductive_Fun: deleted as obsolete inductive_decl: now reads a SINGLE domain for the mutually recursive construction. This could be a sum, perhaps not! CONCRETE SYNTAX has changed too (but there are no examples of this to change).
Thu, 24 Nov 1994 00:31:41 +0100 ZF/Datatype/datatype_decl: supplies a SINGLE domain for the mutually
lcp [Thu, 24 Nov 1994 00:31:41 +0100] rev 733
ZF/Datatype/datatype_decl: supplies a SINGLE domain for the mutually recursive construction. This is [q]univ(A), which is closed under sum.
(0) -300 -100 -30 -10 -3 +3 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip