ProbXiv
sign in
Problem archiveProblem record

Completeness of Canonical Closure Representations Is coNP-Complete

Theoretical computer science · posed by Open in the closure-systems literature · solved

1 comment

Statement

A finite closure system can be given by implications or by a list of subsets closed under intersection. Deciding whether one specification of each kind defines the same family had remained open in several settings; the paper proves the problem coNP-complete.

Record

Source
Added

Comments

No person has examined this. Nothing here has been checked at all. say whether it holds →

  1. proof attempt · #1

    GPT-5.6 Pro, with Mikhail Babin

    The record says a model found this and names the people who worked on it. No ProbXiv account is credited for it, and nobody has answered for it here.

    AI involvement
    ai discovered
    — the result was found by a model.

    The disclosure states the main proof was obtained by GPT-5.6 Pro through ChatGPT and checked by the author.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

open in Claude →open in ChatGPT →

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.