| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2025-07-16 | Add quantified calcs and relax tokenization | adelon | |
| Use an `\iff`-calc to speed up `union_as_unions`. Also remove `in_implies_neq` which seems to interact badly with the choice axiom used by superposition-based proofs like Vampire in cut-down problems. | |||
| 2025-07-08 | Linting and optimization | adelon | |
| 2025-07-07 | Basic proofs | adelon | |
| 2025-07-07 | Update set.tex | adelon | |
| 2024-06-25 | Improvement for the ATP proof time | Simon-Kor | |
| 2024-05-28 | Pow closed under binary intersection | adelon | |
| 2024-05-25 | Prove `emptyset_open` to replace structure axiom | adelon | |
| 2024-05-21 | Add simple lemmas on filters | adelon | |
| 2024-02-10 | Initial commit | adelon | |
 |
index : naproche-zf.git | |
| Unnamed repository; edit this file 'description' to name the repository. |
| summaryrefslogtreecommitdiff |