diff git a/graphoptimization.pdf b/graphoptimization.pdf
index 6cc7299211855e271357cd8c9a4a7c3c565bcae2..2f7642488cf5e0c58eeff95a8f74840cfb43e8c8 100644
Binary files a/graphoptimization.pdf and b/graphoptimization.pdf differ
diff git a/graphoptimization.tex b/graphoptimization.tex
index 8eb360e4a45fb0eb6b03c24659b8a098d2d93fa1..d4828297c563f56e252485e512aae9af3c3b44c9 100644
 a/graphoptimization.tex
+++ b/graphoptimization.tex
@@ 21,7 +21,7 @@
\usetikzlibrary{mmt}
\usepackage[pdftex,
pdfauthor={Michael Banken},
 pdftitle={Styler},
+ pdftitle={TGStyler},
] {hyperref}
\usepackage{makeidx}
\usepackage{graphicx}
diff git a/src/candidates.tex b/src/candidates.tex
index 54988a0831fc715b4481c192f3a06f3e1a4ad456..d08b419e02bf565c26ad224743bbe119e64faf78 100644
 a/src/candidates.tex
+++ b/src/candidates.tex
@@ 1,11 +1,13 @@
\chapter{Optimization Candidates}
\label{chap:candidates}
In order to optimize the theory graph we must first identify cases where it is possible to apply any optimizations. We call such theories \underline{optimization candidates} or just \underline{candidates}.
+To optimize the theory graph we must first identify cases where it is possible to apply any optimizations. We call such theories \underline{optimization candidates} or just \underline{candidates}.
All candidates have in common that they are theories where inclusions can be removed or replaced with weaker inclusions, while still yielding a valid theory as a result without any undeclared symbols (assuming of course a valid theory graph at the start).
For something to be declared a candidates we will only require that the theory itself must remain valid, but not necessarily the stronger case that replacing the candidate with the optimized theory will result in a graph that is still valid as a whole. Of course these considerations will still be applied elsewhere.
+Notably optimization candidates will not necessarily preserve the flattened graph. This is only the case for simply redundant inclusions(see below).
+
\section{Types of optimization candidates}
\subsection{Simply redundant inclusion}
\label{sec:redinc}
@@ 22,12 +24,12 @@ An inclusion of a theory $A\hookrightarrow{}C$ is \underline{simply redundant},
...\\\hline
...
\end{tabular}};
\node[thy, above of = bottom] (middle) {\begin{tabular}{l}
+\node[thy, right of = bottom] (middle) {\begin{tabular}{l}
\textsf{middle}\\\hline
...\\\hline
...
\end{tabular}};
\node[thy, above of = middle] (top) {\begin{tabular}{l}
+\node[thy, right of = middle] (top) {\begin{tabular}{l}
\textsf{top}\\\hline
...\\\hline
...
@@ 49,12 +51,12 @@ Simply redundant inclusions can be safely optimized by simply removing the redun
...\\\hline
...
\end{tabular}};
\node[thy, above of = bottom] (middle) {\begin{tabular}{l}
+\node[thy, right of = bottom] (middle) {\begin{tabular}{l}
\textsf{middle}\\\hline
...\\\hline
...
\end{tabular}};
\node[thy, above of = middle] (top) {\begin{tabular}{l}
+\node[thy, right of = middle] (top) {\begin{tabular}{l}
\textsf{top}\\\hline
...\\\hline
...
@@ 72,7 +74,6 @@ where $Includes(I)$ are the transitively included theories in I and $DirectInclu
It is immediately obvious that removing a simply redundant inclusion I from a theory T also removes it from the above set via the intersection with $DirectIncludes(T)$.\\
Slightly less obvious is that doing so neither adds nor removes any other inclusions. This is because by design the set $\bigcup_{I \in DirectIncludes(T)}Includes(I))$ still includes I and any of its children and thus remains unchanged.

\subsection{Superfluous Inclusion}
\label{sec:superinc}
An inclusion of a theory $A\hookrightarrow{}B$ is \underline{superfluous}, if $B$ uses none of the constants declared in $A$. Such an inclusion can be \underline{purely superfluous} (\autoref{sec:puresi}) if it can be entirely removed, or \underline{partially superfluous} if it can be reduced to a subset of the theory inclusions in $A$ \autoref{sec:partiallysi}.\\
@@ 92,7 +93,7 @@ An inclusion of a theory $A\hookrightarrow{}B$ is \underline{purely superfluous}
X\\\hline
...
\end{tabular}};
\node[thy, above of = bottom] (top) {\begin{tabular}{l}
+\node[thy, right of = bottom] (top) {\begin{tabular}{l}
\textsf{top}\\\hline
...\\\hline
no X
@@ 112,7 +113,7 @@ Purely superfluous inclusions can be removed while still retaining a valid theor
X\\\hline
...
\end{tabular}};
\node[thy, above of = bottom] (top) {\begin{tabular}{l}
+\node[thy, right of = bottom] (top) {\begin{tabular}{l}
\textsf{top}\\\hline
...\\\hline
no X
diff git a/src/titlepage.tex b/src/titlepage.tex
index 9207739998bc428f80d84edb0220bf496a95ef52..5af471aceeafbd089bb65f079c576caae15e940e 100644
 a/src/titlepage.tex
+++ b/src/titlepage.tex
@@ 19,7 +19,7 @@ ErlangenNürnberg%
\Huge\bfseries Styler
\\[1cm]
\large\bfseries
A tool for optimizing theory graphs
+A static analysis tool for optimizing theory graphs
\\[1cm]
\textbf{\large Master Project in Computer Science}
}\\[0.5\baselineskip]