Skip to content

Reqriting -> rewriting #13

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
james-d-mitchell merged 1 commit into from
Oct 27, 2026
Merged

Reqriting -> rewriting #13

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion docs/examples/1-relation/index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@ produce the corresponding decision procedure. In particular, the techniques
described in this paper were applied to a large number of 1-relation monoids to
determine their decidability. Of these, 501 required a modified version of the
Knuth-Bendix procedure along with the termination solver `Matchbox` to find a
complete reqriting system, thus proving decidability.
complete rewriting system, thus proving decidability.

On the following pages, you will find complete rewriting systems for 412 of
those 501 presentations. The complete rewriting systems described here were
Expand Down
Loading