TheoremDB

Problem packetResearch packetR38

R38Sourced evidence

Asser's complement problem remains open

View evidenceOpen source ↗
Link to a section

Authored summary

Current sources leave closure of all first-order spectra under complement open. It is enough to settle three-variable sentences whose finite models are undirected bipartite graphs. The two-variable counting fragment is already closed.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: first-order spectra over arbitrary finite relational vocabularies, with complementation inside the positive integers

Complete recorded scope and conditions
{
  "kind": "universal",
  "statement": "first-order spectra over arbitrary finite relational vocabularies, with complementation inside the positive integers"
}

Originating problem: Asser's complement problem for first-order spectra

Authored record and scope
Authored title
Asser's complement problem remains open
Record type
claim
Stored status
reported
Evidence grade
sourced
Recorded scope data
{ "kind": "universal", "statement": "first-order spectra over arbitrary finite relational vocabularies, with complementation inside the positive integers" }

2Authored explanation

A source and later-work search performed on 2026-07-28 found no proof or counterexample for the general complement question. Durand, Jones, Makowsky, and More state the problem as open and identify the complexity-theoretic equivalence \[ \mathrm{Spec}=\mathrm{coSpec}\quad\Longleftrightarrow\quad \mathrm{NE}=\mathrm{coNE}. \] Kopczyński and Tan prove that the full question can be reduced to first-order sentences with three variables and one symmetric binary relation, under the semantic restriction that every finite model is an undirected bipartite graph. Their earlier two-variable result gives a boundary on the other side: spectra of two-variable logic with counting are exactly the semilinear sets and are closed under complement.

The fixed finite unary-vocabulary calculation in this packet supplies a complete fragment result and an exact quantifier-rank cost. It leaves the three-variable binary-relation frontier untouched. The unresolved remainder is the full statement: construct a first-order spectrum for every complement, or prove that one complement is outside the class of first-order spectra.

Continue this work
Replay material: source only

3Evidence

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, Kopczyński and Tan, Corollary 1.2, pp. 2 and 13–14

4What was measured

Live target

canonical idtdbc1:c99bc72d2b20ed5b974ad96b423fa30c3167dafe67acaa5089c91f9ff0709d55problem number2,828revision idtdbcr1:9fd0c81ed943df5e212e0f2884d2b66e9e1f30ddce965b8ce5e7cbc73f3fc987statement hash5cbafbea8a6b3efbd33fbc64de3dadad2aab0e1f8021c34c344843ba1ffa73a0publication statepublishedresolution stateopenattached record count before packet0

5How it connects

Constrained by

Evidenced by

Addressed by

Replaced by

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R38",
  "content_hash": null,
  "slug": "asser-claim-current-status",
  "type": "claim",
  "title": "Asser's complement problem remains open",
  "summary": "Current sources leave closure of all first-order spectra under complement open. It is enough to settle three-variable sentences whose finite models are undirected bipartite graphs. The two-variable counting fragment is already closed.",
  "relevance": "For Asser's complement problem for first-order spectra, record asser-claim-current-status (“Asser's complement problem remains open”) records a bound, answer, status fact, or structural consequence. The record states: Current sources leave closure of all first-order spectra under complement open.",
  "relevance_source": "recorded",
  "body": "A source and later-work search performed on 2026-07-28 found no proof or counterexample for the general complement question. Durand, Jones, Makowsky, and More state the problem as open and identify the complexity-theoretic equivalence\n\\[\n\\mathrm{Spec}=\\mathrm{coSpec}\\quad\\Longleftrightarrow\\quad \\mathrm{NE}=\\mathrm{coNE}.\n\\]\nKopczyński and Tan prove that the full question can be reduced to first-order sentences with three variables and one symmetric binary relation, under the semantic restriction that every finite model is an undirected bipartite graph. Their earlier two-variable result gives a boundary on the other side: spectra of two-variable logic with counting are exactly the semilinear sets and are closed under complement.\n\nThe fixed finite unary-vocabulary calculation in this packet supplies a complete fragment result and an exact quantifier-rank cost. It leaves the three-variable binary-relation frontier untouched. The unresolved remainder is the full statement: construct a first-order spectrum for every complement, or prove that one complement is outside the class of first-order spectra.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "universal",
    "statement": "first-order spectra over arbitrary finite relational vocabularies, with complementation inside the positive integers"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.23638/LMCS-14(2:4)2018",
      "locator": "Kopczyński and Tan, Corollary 1.2, pp. 2 and 13–14"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.23638/LMCS-14(2:4)2018",
    "locator": "Kopczyński and Tan, Corollary 1.2, pp. 2 and 13–14"
  },
  "models": [],
  "relations": [
    {
      "slug": "R40",
      "title": "Three-variable bipartite graph sentences suffice",
      "object_type": "claim",
      "relation": "supports",
      "direction": "incoming"
    },
    {
      "slug": "R37",
      "title": "The two-variable counting fragment is closed under complement",
      "object_type": "claim",
      "relation": "supports",
      "direction": "incoming"
    },
    {
      "slug": "R39",
      "title": "Every fixed monadic vocabulary needs at most one extra rank",
      "object_type": "claim",
      "relation": "informs",
      "direction": "incoming"
    },
    {
      "slug": "R36",
      "title": "Sentence negation does not complement the spectrum",
      "object_type": "attempt",
      "relation": "constrains",
      "direction": "incoming"
    },
    {
      "slug": "R34",
      "title": "Dated source and duplicate audit",
      "object_type": "attempt",
      "relation": "evidences",
      "direction": "incoming"
    },
    {
      "slug": "R35",
      "title": "Mechanize the three-variable bipartite reduction",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "R1813",
      "title": "Asser's complement problem remains open",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "incoming",
      "metadata": {
        "reason": "Preserves the published record identity while attaching the independently reviewed release-300 bibliography."
      }
    },
    {
      "slug": "first-order-spectra-complement-closure",
      "title": "first order spectra complement closure",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

7Provenance

View source, identifiers, and projection details

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.