Coherence and computational complexity of quantifier-free dependence logic formulas (Q1956380): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1991388620
@@ Property / OpenAlex ID: W1991388620 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4058132
@@ Property / cites work: Q4058132 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite model theory and its applications.
@@ Property / cites work: Finite model theory and its applications. / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+On definability in dependence logic
@@ Property / cites work: On definability in dependence logic / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3446107
@@ Property / cites work: Q3446107 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1956380