diff --git a/ch07_authorization-authentication.adoc b/ch07_authorization-authentication.adoc
index 69bdf972..c69771ec 100644
--- a/ch07_authorization-authentication.adoc
+++ b/ch07_authorization-authentication.adoc
@@ -1670,7 +1670,7 @@ exceeds the number of conditions that all the computers in the world
 could create.
 
 It's commonly the case that not every authorization condition is equally
-as likely to be used.  In the our example case, we expect Mohammed and
+as likely to be used.  In our example case, we expect Mohammed and
 his partners to spend their money frequently; the time delayed
 conditions only exist in case something goes wrong.  We can restructure
 our tree with this knowledge as shown in <<diagram_mast3>>.
@@ -1698,8 +1698,8 @@ Except for increasing the complexity of Bitcoin slightly, there are no
 significant downsides of MAST for Bitcoin and there were two solid
 proposals for it, BIP114 and BIP116, before an improved approach was
 discovered, which we'll see in <<taproot>>.
-
-.MAST Versus MAST
+[[mast_versus_mast]]
+=== MAST Versus MAST
 ****
 The earliest((("abstract syntax trees (AST)")))((("AST (abstract syntax trees)"))) idea for what we now know as _MAST_ in Bitcoin was
 _merklized abstract syntax trees_.  In an abstract syntax tree (AST),