feat: prove that omega-regular languages are closed under complementation #329
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…n of omega-languages of a special form
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR reaches a major milestone by proving that omega-regular languages are closed under complementation, using W. Thomas's presentation of R. Büchi's original proof. Most of the groundwork has been laid in previous PRs and the only nontrivial theorem proved in this PR is
buchiFamily_coverin BuchiCongruence.lean, which uses the Ramsey theorem for infinite graphs.This PR depends on #281 and #325, the latter of which in turn depends on #278.