Feature request: eliminate duplicates in sequent lists
Nobody has claimed this yet.
- Dominant language
- UrWeb
- Stars
- 155
- Forks
- 12
- PR merge metrics
- No merged PRs in 30d
Description
I was exploring whether I could have my discrete structures class use this for logic puzzles like knight and knaves. I'll have to look at the code after the semester, but it would be nice to have an option to eliminate repeated literals (or expressions) in the lists of sequents.
E.g.,
A: B is a knave if and only if C is a knight
B: C is a knight or A is a knave
A <-> (~B <-> C), B <-> (C / ~A) |-
It would be cleaner if it would derive B,C |- A instead of B,C,C,B |- A and B,C,B |- A,A.
Contributor guide
No contributing guide indexed for this repository
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
No files, tests, or entry points are named. Start by locating the code that builds sequent lists and any existing option handling, then trace how repeated literals or expressions enter derivations. Done means an option produces the cleaner B,C |- A and B,C |- A,A results described in the issue without unwanted duplicates.
Written by the indexing model from the issue text.
Assessment
- Domain
- compilers
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100