How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
CFG equivalence is undecidable
Statement
The CFG equivalence problem is undecidable.
Facts & Assumptions
Given: A context-free grammar over a terminal alphabet .
The CFG equivalence problem asks whether two CFGs generate the same language, by The CFG equivalence and ambiguity problems.
CFG universality is undecidable, by CFG universality is undecidable.
Proof
Let be a fixed grammar generating . Such a grammar is easy to write, for example with productions Then
Therefore a decision procedure for CFG equivalence would decide whether by comparing with the fixed universal grammar . That would decide CFG universality, contradicting [L2].
Hence CFG equivalence is undecidable.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- John Watrous, Introduction to the Theory of Computing (standard reference, not scraped)