{"database": "team-science", "table": "adjacent_pair", "rows": [["ap-08eb5d7ba7", "problem", "ax-2608.26628-7704b05b", "Problem 3.2: Is there a decision procedure which, given quantifier patterns $\\overline{P},\\overline{Q}\\in\\{\\exists,\\forall,\\exists^{\\infty},\\forall^{\\infty}\\}^{ decides whether $\\langle\\overline{P}\\rangle\\leq_{m}\\langle\\overline{Q}\\rangle?$", "method", "m-automata-formal-language-decision-procedures", "automata / formal language decision procedures", null, "adjacent-field", "novel", "0 ingested paper titles mention both sides (text proxy for #177 pair-novelty) \u00b7 withdrawn: v0.1 random draw superseded by combinability v0.2 (drawn only for a named signal)", "withdrawn", null, "2026-09-02T18:02:06Z", null, null, null, null, null]], "columns": ["id", "a_kind", "a_ref", "a_label", "b_kind", "b_ref", "b_label", "bridge", "distance", "novelty", "evidence", "status", "asked_by", "created_ts", "signal", "score", "why", "prompt", "reading"], "primary_keys": ["id"], "primary_key_values": ["ap-08eb5d7ba7"], "units": {}, "query_ms": 2.902052830904722, "source": "TeamScience Space repository", "source_url": "https://commons.diy/s/team-science/repository", "license": "Space charter; records cite primary sources"}