Representing inductively defined sets by wellorderings in Martin-Löf's type theory (Q1392287): Difference between revisions

@@ Property / cites work @@
+Q5753923
@@ Property / cites work: Q5753923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012883
@@ Property / cites work: Q4012883 / rank @@
+Normal rank
@@ Property / cites work @@
+Inductive families
@@ Property / cites work: Inductive families / rank @@
+Normal rank
@@ Property / cites work @@
+Q4296744
@@ Property / cites work: Q4296744 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5638283
@@ Property / cites work: Q5638283 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructive mathematics and computer programming
@@ Property / cites work: Constructive mathematics and computer programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q3688389
@@ Property / cites work: Q3688389 / rank @@
+Normal rank
@@ Property / cites work @@
+Proving termination of normalization functions for conditional expressions
+Normal rank
@@ Property / cites work @@
+A set constructor for inductive sets in Martin-Löf's type theory
+Normal rank