The unification hierarchy is undecidable (Q1181721): Difference between revisions

@@ Property / cites work @@
+The theory of idempotent semigroups is of unification type zero
+Normal rank
@@ Property / cites work @@
+On unification: Equational theories are not bounded
+Normal rank
@@ Property / cites work @@
+Q3779785
@@ Property / cites work: Q3779785 / rank @@
+Normal rank
@@ Property / cites work @@
+Complete sets of unifiers and matchers in equational theories
+Normal rank
@@ Property / cites work @@
+Unsolvable problems for equational theories
@@ Property / cites work: Unsolvable problems for equational theories / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678447
@@ Property / cites work: Q5678447 / rank @@
+Normal rank
@@ Property / cites work @@
+A Machine-Oriented Logic Based on the Resolution Principle
+Normal rank
@@ Property / cites work @@
+Q5677651
@@ Property / cites work: Q5677651 / rank @@
+Normal rank
@@ Property / cites work @@
+Unification under associativity and idempotence is of type nullary
+Normal rank
@@ Property / cites work @@
+Unification in a combination of arbitrary disjoint equational theories
+Normal rank
@@ Property / cites work @@
+Unification theory
@@ Property / cites work: Unification theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785922
@@ Property / cites work: Q3785922 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf00249020
+Normal rank
@@ Property / OpenAlex ID @@
+W2074681477
@@ Property / OpenAlex ID: W2074681477 / rank @@
+Normal rank