Completeness of Canonical Closure Representations Is coNP-Complete
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.
Exact FrontierDelta
Scope and record
Occurred: Jul 20, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-discovered. Imported under CC BY 4.0.
Canonical aliases: Completeness of Canonical Closure Representations Is coNP-Complete · Closure completeness
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
Mikhail Babin
human · human collaborator
GPT-5.6 Pro
model · ai model contributor · OpenAI
Lineage and corrections
This event attributed to Mikhail Babin
This event attributed to GPT-5.6 Pro