We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 0ac76b8 commit 43fefafCopy full SHA for 43fefaf
1 file changed
README.md
@@ -22,7 +22,7 @@ This repository contains a formalization of Mazurkiewicz trace theory in the Lea
22
23
### Misc
24
- `List.lean` contains misc. definitions and lemmas for `List` (string) manipulation.
25
-- `Occurences.lean` formalizes ordering of symbol occurrences.
+- `Occurrence.lean` formalizes ordering of symbol occurrences.
26
- `EdgeSubset.lean` is a proof of the negation of a claim in The Book of Traces (Proposition 1.4.2).
27
- `Computability.lean` supplies a full proof of Kleene's theorem together with mathlib4.
28
0 commit comments