lean-ja / lean-ja/lean-by-example
等式系における合同閉包が決定可能であること
Open
Nobody has claimed this yet.
付録アイデア
- Dominant language
- Lean
- Stars
- 188
- Forks
- 15
- Avg merge
- 9h 8m
- Merged PRs (30d)
- 6
Description
これは、数学的には非自明ではある。Lean で証明するにはどうするのか？
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names no file, test, or entry point. Start by locating the relevant Lean example or proof area in the repository, then determine the required statement and proof approach for decidability of congruence closure in equational systems. Done means adding a complete Lean proof with suitable verification.
Written by the indexing model from the issue text.
Assessment
- Domain
- tooling
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100