THE TYPE SET OF A VARIETY IS NOT COMPUTABLE (Q4786272): Difference between revisions

@@ Property / cites work @@
+An approach to tame congruence theory via subtraces
+Normal rank
@@ Property / cites work @@
+The set of types of a finitely generated variety
@@ Property / cites work: The set of types of a finitely generated variety / rank @@
+Normal rank
@@ Property / cites work @@
+FINDING TYPE SETS IS NP-HARD
@@ Property / cites work: FINDING TYPE SETS IS NP-HARD / rank @@
+Normal rank
@@ Property / cites work @@
+An Easy Way to Minimal Algebras
@@ Property / cites work: An Easy Way to Minimal Algebras / rank @@
+Normal rank
@@ Property / cites work @@
+THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
+Normal rank
@@ Property / cites work @@
+TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
@@ Property / cites work: TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE / rank @@
+Normal rank
@@ Property / cites work @@
+On McKenzie's method
@@ Property / cites work: On McKenzie's method / rank @@
+Normal rank
@@ Property / cites work @@
+Tarski’s finite basis problem via 𝐀(𝒯)
@@ Property / cites work: Tarski’s finite basis problem via 𝐀(𝒯) / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0218196701000504
+Normal rank
@@ Property / OpenAlex ID @@
+W2005032685
@@ Property / OpenAlex ID: W2005032685 / rank @@
+Normal rank