Reflexive digraphs with near unanimity polymorphisms (Q442320): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 05C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6064639
@@ Property / zbMATH DE Number: 6064639 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+reflexive digraphs
@@ Property / zbMATH Keywords: reflexive digraphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+near unanimity
@@ Property / zbMATH Keywords: near unanimity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Jonsson
@@ Property / zbMATH Keywords: Jonsson / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+gumm and totally symmetric idempotent polymorphisms
+Normal rank
@@ Property / zbMATH Keywords @@
+constraint satisfaction
@@ Property / zbMATH Keywords: constraint satisfaction / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+(1
@@ Property / zbMATH Keywords: (1 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+)-consistency checking algorithm
@@ Property / zbMATH Keywords: 2)-consistency checking algorithm / rank @@
+Normal rank

Revision as of 02:21, 30 June 2023