aboutsummaryrefslogtreecommitdiff
path: root/sage/group_prover.sage
diff options
context:
space:
mode:
Diffstat (limited to 'sage/group_prover.sage')
-rw-r--r--sage/group_prover.sage4
1 files changed, 2 insertions, 2 deletions
diff --git a/sage/group_prover.sage b/sage/group_prover.sage
index ab580c5b23..8521f07999 100644
--- a/sage/group_prover.sage
+++ b/sage/group_prover.sage
@@ -3,7 +3,7 @@
# to independently set assumptions on input or intermediary variables.
#
# The general approach is:
-# * A constraint is a tuple of two sets of of symbolic expressions:
+# * A constraint is a tuple of two sets of symbolic expressions:
# the first of which are required to evaluate to zero, the second of which
# are required to evaluate to nonzero.
# - A constraint is said to be conflicting if any of its nonzero expressions
@@ -17,7 +17,7 @@
# - A constraint describing the requirements of the law, called "require"
# * Implementations are transliterated into functions that operate as well on
# algebraic input points, and are called once per combination of branches
-# exectured. Each execution returns:
+# executed. Each execution returns:
# - A constraint describing the assumptions this implementation requires
# (such as Z1=1), called "assumeFormula"
# - A constraint describing the assumptions this specific branch requires,