diff --git a/Hybrid-assoc-lists.md b/Hybrid-assoc-lists.md
index 5bb6ca8..90b260d 100644
--- a/Hybrid-assoc-lists.md
+++ b/Hybrid-assoc-lists.md
@@ -4,7 +4,7 @@ In it's current very prototype stage, PSSE has to forms of name/value store. One
 
 An assoc (association) list is a list of the form:
 
-    ((name<sub>1</sub> . value<sub>1</sub>)(name<sub>2</sub> . value<sub>2</sub>)(name<sub>3</sub> . value<sub>3</sub>)...)
+((name<sub>1</sub> . value<sub>1</sub>)(name<sub>2</sub> . value<sub>2</sub>)(name<sub>3</sub> . value<sub>3</sub>)...)
 
 Hashmaps have many very clear advantages, but assoc lists have one which is very important in the evaluation environment, and that is precisely its sequentiality. Thus, if the same name is bound twice on an assoc list, the value nearest the head is the one which will be recovered: