rec-thy (26sep17)

git-svn-id: svn://tug.org/texlive/trunk@45407 c570f23f-e606-0410-a88d-b1316a301751

4 files changed, 476 insertions, 210 deletions

diff --git a/Master/texmf-dist/doc/latex/rec-thy/README b/Master/texmf-dist/doc/latex/rec-thy/README
index 575de72d7b1..ed3d5b66485 100644
--- a/Master/texmf-dist/doc/latex/rec-thy/README
+++ b/Master/texmf-dist/doc/latex/rec-thy/README
@@ -21,4 +21,5 @@ Github URL: https://github.com/TruePath/Recursion-Theory-Latex-Package
 
 10/15/2010 - v1.0 - Original Release
 01/01/2011 - v1.2
-06/20/2012 - v1.3
\ No newline at end of file
+06/20/2012 - v1.3
+09/26/2017 - v2.0 - Added support for introducing requirements, the subfunction relation and probably other undocumented features
\ No newline at end of file
diff --git a/Master/texmf-dist/doc/latex/rec-thy/rec-thy.pdf b/Master/texmf-dist/doc/latex/rec-thy/rec-thy.pdf
index 04a5d925f3f..a415a2a2bb3 100644
--- a/Master/texmf-dist/doc/latex/rec-thy/rec-thy.pdf
+++ b/Master/texmf-dist/doc/latex/rec-thy/rec-thy.pdf
diff --git a/Master/texmf-dist/doc/latex/rec-thy/rec-thy.tex b/Master/texmf-dist/doc/latex/rec-thy/rec-thy.tex
index 7ffc6f6b575..4f19e98c29b 100644
--- a/Master/texmf-dist/doc/latex/rec-thy/rec-thy.tex
+++ b/Master/texmf-dist/doc/latex/rec-thy/rec-thy.tex
@@ -6,12 +6,18 @@
 %
 
 \documentclass[11pt,oneside]{article}
-\usepackage{amsfonts}
+\usepackage{amsmath}
+% \RequirePackage{amsmath}
+\usepackage[disallowspaces,fixamsmath]{mathtools}
+\usepackage{amssymb}
+\usepackage{amsthm}
+% \usepackage{amsfonts}
 \usepackage{rec-thy}
 \usepackage{multirow}
 \usepackage{booktabs}
-\usepackage{xtab} 
+\usepackage{xtab}
 \usepackage{hyperref}
+\usepackage{listings}
 
 
 \newcommand{\tab}{\hspace{1cm}}
@@ -65,7 +71,7 @@ Comments, patches, suggestions etc.. are all welcome.  This project is hosted on
 \section{Usage}
 Include the package in your document by placing \verb=\usepackage{rec-thy}= into your preamble after placing rec-thy.sty somewhere \TeX{ } can find it.  The commands in this package have been divided into related groups.  The commands in a given section can be disabled by passing the appropriate package option.  For instance to disable the commands in the general mathematics section and the delimiters section you would include the following in your preamble \verb=\usepackage[nomath,nodelim]{rec-thy}=.  The commands in each subsection along with their results are listed below and the options to disable the commands in each grouping or modify their behavior are listed in that subsection.  Aliases and variants of a command are listed below the initial version of a command and aliases are indented.
 
-Significant use is made in this package of optional arguments delimited either by square brackets or parenthesis.  Users of the package should take care to wrap arguments that may themselves include brackets or parenthesis in braces.  For example \verb=\REset(\REset(X){e}){i}= should be fixed to \verb=\REset({\REset(X){e}}){i}=.   
+Significant use is made in this package of optional arguments delimited either by square brackets or parenthesis.  Users of the package should take care to wrap arguments that may themselves include brackets or parenthesis in braces.  For example \verb=\REset(\REset(X){e}){i}= should be fixed to \verb=\REset({\REset(X){e}}){i}=.
 
 \section{Commands}
 A few general conventions are usually followed in the commands.  Whenever an operator can be used as a binary operator (as in \( X \union Y \)) and as an operation on some collection \( \Union_{i \in \omega} X_i \) the binary operator will begin with a lowercase letter \verb=\union= and the operation on the collection will begin with a capital letter \verb=\Union=.  If the first letter is already capitalized then the second letter is used instead.
@@ -73,10 +79,11 @@ A few general conventions are usually followed in the commands.  Whenever an ope
 Objects that have a natural stagewise approximation generally admit an optional argument in brackets to specify a stage.  For instance \( \verb=\REset[s]{e}= \) yields \( \REset[s]{e} \).  An optional argument in parenthesis is used for relativization.  For instance \( \verb=\REset(X){e}= \) produces \( \REset(X){e} \).  A notable exception to this rule are the formula classes where square brackets are used to indicate an oracle to be placed in the superscript, e.g.,  \( \verb=\pizn[X]{2}= \) yields \( \pizn[X]{2} \), so as not to generate confusion with the alternative notion \( \pizn{2}(X) \).  Also a lowercase first letter in a formula class indicates the lightface version while a capital first letter indicates the boldface version.
 
 Unless indicated otherwise all macros are to be used inside math mode.  Indented commands indicate an alias for the command on the line above
+\( \mathfrak{u} \)
 \subsection{Computations}
 To disable these commands pass the option \verb=nocomputations=. \\
 
-\begin{xtabular}{l |  l | l}\toprule 
+\begin{xtabular}{l |  l | l}\toprule
 	\verb=\murec{x}{f(x)>1}=					& \( 	\murec{x}{f(x)>1}                     \)	& Least \( x \) satisfying condition. \\ \midrule
 	\verb=\recfnl{e}{Y}{x}=                                	& \( 	\recfnl{e}{Y}{x}                      	   \)   &\multirow{4}{*}{Computable functions/functionals} \\[6pt]
 	\verb=\recfnl[s]{e}{Y}{x}=                             & \( 	\recfnl[s]{e}{Y}{x}                   	   \)   & \\[6pt]
@@ -90,16 +97,16 @@ To disable these commands pass the option \verb=nocomputations=. \\
 	\verb=\recfnl{e}{}{x}\nconv=                           & \( 	\recfnl{e}{}{x}\nconv                 	   \)   &\multirow{2}{*}{Divergence} \\[6pt]
 	\tab \verb=\recfnl{e}{}{x}\nconv[s]=                        & \( 	\recfnl{e}{}{x}\nconv[s]              	   \)   & \\ \midrule
 	\verb=\use{\recfnl{e}{Y}{x}}=                          & \( 	\use{\recfnl{e}{Y}{x}}                	   \)   & Use of a computation. \\ \midrule
-	\verb=\REset{e}=                                       & \( 	\REset{e}                             	   \)   & \multirow{4}{*}{c.e. sets} \\[6pt] 
-	 \verb=\REset[s]{e}=                                    & \( 	\REset[s]{e}                          	   \)   & \\[6pt] 
-	 \verb=\REset(X){e}=                                    & \( 	\REset(X){e}                          	   \)   & \\[6pt] 
+	\verb=\REset{e}=                                       & \( 	\REset{e}                             	   \)   & \multirow{4}{*}{c.e. sets} \\[6pt]
+	 \verb=\REset[s]{e}=                                    & \( 	\REset[s]{e}                          	   \)   & \\[6pt]
+	 \verb=\REset(X){e}=                                    & \( 	\REset(X){e}                          	   \)   & \\[6pt]
 	 \verb=\REset[s](X){e}=                                 & \( 	\REset[s](X){e}                       	   \)   & \\ \midrule
-	\verb=\iREAop{e}(\eset)=                               & \multirow{2}{*}{\( 	\iREAop{e}(\eset)                     	   \)}   &\multirow{2}{*}{1-REA operator} \\ 
+	\verb=\iREAop{e}(\eset)=                               & \multirow{2}{*}{\( 	\iREAop{e}(\eset)                     	   \)}   &\multirow{2}{*}{1-REA operator} \\
 	\tab \verb=\reaop*{e}(\eset)=                               &    & \\ \midrule
 	\verb=\alphaREAop{\alpha}(\eset)=                      & \multirow{2}{*}{\( 	\alphaREAop{\alpha}(\eset)            	   \)}   &\multirow{2}{*}{\( \alpha \)-REA operator} \\[6pt]
 	\tab \verb=\reaop{\alpha}(\eset)=                           &    & \\[6pt]
 	\verb=\alphaREAop[f]{\alpha}(\eset)=                   & \multirow{2}{*}{\( 	\alphaREAop[f]{\alpha}(\eset)         	   \)}   & \multirow{2}{*}{with particular witness to uniformity}\\[6pt]
-	\tab \verb=\reaop[f]{\alpha}(\eset)=                        &  & \\ 
+	\tab \verb=\reaop[f]{\alpha}(\eset)=                        &  & \\
 		\bottomrule
 	\end{xtabular}          \\
 
@@ -107,7 +114,7 @@ To disable these commands pass the option \verb=nocomputations=. \\
 To disable these commands pass the option \verb=nodegrees=. \\
 
 
-\begin{xtabular}{l |  l | l}\toprule 
+\begin{xtabular}{l |  l | l}\toprule
 	\verb=\Tdeg{d}=                                        & \( 	\Tdeg{d}                              	   \)   & Turing degree \\ \midrule
 	\verb=\Tjump{X}=                                       & \multirow{2}{*}{\( 	\Tjump{X}                             	   \)}   & \multirow{2}{*}{Turing jump} \\
 	\tab \verb=\jump{X}=                                        &  & \\ \midrule
@@ -118,9 +125,9 @@ To disable these commands pass the option \verb=nodegrees=. \\
 	\verb=\zerojj=                                         & \( 	\zerojj                               	   \)   & \\ \midrule
 	\verb=\zerojjj=                                        & \( 	\zerojjj                              	   \)   & \\ \midrule
 	\verb=\zeron{n}=                                       & \( 	\zeron{n}                             	   \)   & \\ \midrule
-	\verb=X \Tequiv Y=                                     & \multirow{2}{*}{\( 	X \Tequiv Y                           	   \)}   & \multirow{2}{*}{Turing equivalence}\\ 
+	\verb=X \Tequiv Y=                                     & \multirow{2}{*}{\( 	X \Tequiv Y                           	   \)}   & \multirow{2}{*}{Turing equivalence}\\
 	\tab \verb=X \Teq Y=                                        &   & \\ \midrule
-	\verb=X \nTequiv Y=                                    & \multirow{2}{*}{\( 	X \nTequiv Y                          	   \)}   & \multirow{2}{*}{Turing inequivalence} \\ 
+	\verb=X \nTequiv Y=                                    & \multirow{2}{*}{\( 	X \nTequiv Y                          	   \)}   & \multirow{2}{*}{Turing inequivalence} \\
 	\tab \verb=X \nTeq Y=                                       &    & \\ \midrule
         \verb=X \Tlneq Y=                                      & \(  X \Tlneq Y                              	   \)   & \\ \midrule
         \verb=X \Tleq  Y=                                      & \(  X \Tleq  Y                              	   \)   & \\ \midrule
@@ -131,11 +138,11 @@ To disable these commands pass the option \verb=nodegrees=. \\
         \verb=X \nTleq Y=                                      & \(  X \nTleq Y                              	   \)   & \\ \midrule
         \verb=X \nTgeq Y=                                      & \(  X \nTgeq Y                              	   \)   & \\ \midrule
 	\verb=\Tdeg{d} \Tdegjoin \Tdeg{d'}=                    & \( 	\Tdeg{d} \Tdegjoin \Tdeg{d'}          	   \)   & Join of degrees\\ \midrule
-	\verb=\Tdeg{d} \Tdegmeet \Tdeg{d'}=                    & \multirow{2}{*}{\( 	\Tdeg{d} \Tdegmeet \Tdeg{d'}          	   \)}   & \multirow{2}{*}{Meet of degrees (when defined)} \\ 
+	\verb=\Tdeg{d} \Tdegmeet \Tdeg{d'}=                    & \multirow{2}{*}{\( 	\Tdeg{d} \Tdegmeet \Tdeg{d'}          	   \)}   & \multirow{2}{*}{Meet of degrees (when defined)} \\
 	\tab \verb=\Tdeg{d} \Tmeet \Tdeg{d'}=                       &    & \\ \midrule
-	\verb=X \Tplus Y=                                      & \multirow{2}{*}{\( 	X \Tplus Y                            	   \)}   & \multirow{4}{*}{Effective join of sets} \\ 
-	\tab \verb=X \Tjoin Y=                                      &  & \\ 
-	\verb=\TPlus_{i \in \omega} X_i=                       & \multirow{2}{*}{\( 	\TPlus_{i \in \omega} X_i            \)}   & \\ 
+	\verb=X \Tplus Y=                                      & \multirow{2}{*}{\( 	X \Tplus Y                            	   \)}   & \multirow{4}{*}{Effective join of sets} \\
+	\tab \verb=X \Tjoin Y=                                      &  & \\
+	\verb=\TPlus_{i \in \omega} X_i=                       & \multirow{2}{*}{\( 	\TPlus_{i \in \omega} X_i            \)}   & \\
 	\tab \verb=\TJoin_{i \in \omega} X_i=                       &    & \\ \midrule
 	% \verb=\ttSYM=                                          & \( 	\ttSYM                                	   \)   & \\ \midrule
 	\verb=X \ttlneq Y=                                     & \( 	X \ttlneq Y                           	   \)   & Truth table reducibilities\\ \midrule
@@ -144,56 +151,100 @@ To disable these commands pass the option \verb=nodegrees=. \\
 	\verb=X \ttgeq  Y=                                     & \( 	X \ttgeq  Y                           	   \)   & \\ \midrule
 	\verb=X \ttgtr  Y=                                     & \( 	X \ttgtr  Y                           	   \)   & \\ \midrule
 	\verb=X \ttless Y=                                     & \( 	X \ttless Y                           	   \)   & \\ \midrule
-	\verb=X \ttTleq Y=                                     & \( 	X \ttTleq Y                           	   \)   & \\ \midrule
-        \verb=X \ttTgeq Y=                                     & \(  X \ttTgeq Y                             	   \)   & \\ 
+	\verb=X \ttnleq Y=                                     & \( 	X \ttnleq Y                           	   \)   & \\ \midrule
+        \verb=X \ttngeq Y=                                     & \(  X \ttngeq Y                             	   \)   & \\
 		\bottomrule
 	\end{xtabular}          \\
+\makeatletter
+\subsection{Requirement Assistance}
+To disable these commands pass the option \verb=noreqhelper=. To disable the hyperlinked requirements pass \verb=nohyperreqs=\\
+Math mode is not required for \verb=\req{R}{e\}=
+
+\begin{tabular}{l |  l | l}\toprule
+\verb=\req{R}{e}=			 &  \( \req{R}{e} \) & \multirow{3}{*}{Requirement } \\ \midrule
+\verb=\req[\nu]{R}{e\}=	&  \req[\nu]{R}{e} & \\ \midrule
+\verb=\req*{R}{e\}=			 &  \req{R}{e} & \multirow{3}{*}{Requirement without hyperlinks} \\ \midrule
+\verb=\req*[\nu]{R}{e\}=	&  \req[\nu]{R}{e} & \\ \midrule
+	\bottomrule
+\end{tabular}          \\
+
+We also introduce the following two enviornments for introducing requirements.  The requirement enviornment is used as follows
+
+\begin{lstlisting}[breaklines]
+	\begin{requirement}{\req{R^{*}}{r,j}}
+		\recfnl{r}{B}{} = \REset{j} \implies   \exists[k] \left( \Upsilon^{j}_k(C \Tplus \REset{j}) = B) \lor \REset{j} \Tleq \Tzero \right) 
+	\end{requirement}
+\end{lstlisting}
+
+Giving output 
+
+	\begin{requirement}{\req{R^{*}}{r,j}}
+		\recfnl{r}{B}{} = \REset{j} \implies   \exists[k] \left( \Upsilon^{j}_k(C \Tplus \REset{j}) = B) \lor \REset{j} \Tleq \Tzero \right) 
+	\end{requirement}
+
+The require enfiornment merges the \verb=\req[\nu]{R}{e\}= command directly into the enviornment arguments.  It also creates an automatic label which makes use of the 1st and 2nd arguments but assumes the third are just indexes whose names are subject to change.  Unless \verb=nohyperreqs= is passed the \verb=\req[\nu]{R}{e\}= automatically links to the defining require enviornment.
+
+\begin{lstlisting}[breaklines]
+\begin{require}{R}{i}
+	\recfnl{i}{B}{} = \REset{i} \implies   \exists[k] \left( \Upsilon^{i}_k(C \Tplus \REset{i}) = B) \lor \REset{j} \Tleq \Tzero \right)
+\end{require}
+\end{lstlisting}
+
+ Giving output 
+
+\begin{require}{R}{i}
+	\recfnl{i}{B}{} = \REset{i} \implies   \exists[k] \left( \Upsilon^{i}_k(C \Tplus \REset{i}) = B) \lor \REset{j} \Tleq \Tzero \right)
+\end{require}
+
+
 
 
 \subsection{General Math Commands}
 To disable these commands pass the option \verb=nomath=. \\
 
-\begin{tabular}{l |  l | l}\toprule                                
+\begin{tabular}{l |  l | l}\toprule
 	\verb=\eqdef= 					& \( \eqdef \) & Definitional equals\\ \midrule
 	\verb=\iffdef= 					& \( \iffdef \) & Definitional equivalence\\	\midrule
 	\verb=\aut= 					& \( \aut \)  & Automorphisms of some structure\\ \midrule
 	\verb=\Ord= 					& \( \Ord \) & Set of ordinals\\\midrule
 	\verb=x \meet y= 				& \( x \meet y \) & \multirow{2}{*}{Meet operation} \\[6pt]
 	\verb=\Meet_{i\in \omega} x_i=		& \( \Meet_{i\in \omega} x_i \) & \\ \midrule
-	\verb=x \join y= 				& \(x  \join y \) & \multirow{2}{*}{Join operation}  \\[6pt] 
+	\verb=x \join y= 				& \(x  \join y \) & \multirow{2}{*}{Join operation}  \\[6pt]
 	\verb=\Join_{i\in \omega} x_i=		& \( \Join_{i\in \omega} x_i \) & \\ \midrule
 	\verb=\abs{x}= 					& \( \abs{x} \) & Absolute value\\ \midrule
 	\verb=\dom= 					& \( \dom \) & Domain \\ \midrule
 	\verb=\rng= 					& \( \rng \) & Range\\ \midrule
 	\verb=f\restr{X}= 				& \( f\restr{X} \) & Restriction\\ \midrule
 	\verb=\ordpair{x}{y}= 				& \( \ordpair{x}{y} \)& Ordered Pair\\ \midrule
-	\verb=f\map{X}{Y}= 				& \( f\map{X}{Y} \) & \multirow{2}{*}{Function specification} \\ 
+	\verb=f\map{X}{Y}= 				& \( f\map{X}{Y} \) & \multirow{2}{*}{Function specification} \\
 	\verb=\functo{f}{X}{Y}= 			& \( \functo{f}{X}{Y} \) &\\ \midrule
 	\verb=f \compfunc g=		       		& \multirow{3}{*}{\( f \compose g \)} & \multirow{3}{*}{Function composition}\\
 	\tab \verb=f \funcomp g=	            		& &\\
 	\tab \verb=f \compose g=	            		& &\\ \midrule
 	\verb=\( \ensuretext{blah} \)=	           	& \multirow{2}{*}{\( \ensuretext{blah} \)}& \multirow{2}{*}{Types argument in text mode} \\
 	\tab \verb=\ensuretext{blah}=			& & \\
+
 	\bottomrule
 \end{tabular}          \\
 \newpage
-\subsection{Set Notation}      
+\subsection{Set Notation}
 To disable these commands pass the option \verb=nosets=.\\
 
 \begin{tabular}{l |  l | l}\toprule
-	\verb=\set{(x,y)}{x > y}=	  &    \(   \set{(x,y)}{x > y} \)    & \multirow{2}{*}{Set notation}  \\[6pt] 
-	\verb=\set{(x,y)}}{}=		  &    \(   \set{(x,y)}{}      \)    &  \\ \midrule
+	\verb=\set{(x,y)}{x > y}=	  &    \(   \set{(x,y)}{x > y} \)    & \multirow{2}{*}{Set notation}  \\[6pt]
+	\verb=\set{(x,y)}{}=		  &    \(   \set{(x,y)}{}      \)    &  \\ \midrule
+	\verb=\set{(x,y)}=			  & 	\(   \set{(x,y)}      \)    &  \\ \midrule
 	\verb=\card{X}=                          &    \(   \card{X}                   \)    & Cardinality \\ \midrule
-	\verb=X \union Y=                        &    \(   X \union Y                 \)    & \multirow{2}{*}{Union}  \\[6pt] 
+	\verb=X \union Y=                        &    \(   X \union Y                 \)    & \multirow{2}{*}{Union}  \\[6pt]
 	\verb=\Union_{i \in \omega} X_i=         &    \(   \Union_{i \in \omega} X_i  \)    &  \\ \midrule
-	\verb=X \isect Y=                        &    \(   X \isect Y                 \)    & \multirow{2}{*}{Intersection} \\[6pt] 
+	\verb=X \isect Y=                        &    \(   X \isect Y                 \)    & \multirow{2}{*}{Intersection} \\[6pt]
 	\verb=\Isect_{i \in \omega} X_i=         &    \(   \Isect_{i \in \omega} X_i  \)    &  \\ \midrule
-	\verb=X \cross Y=                        &    \(   X \cross Y                 \)    & \multirow{2}{*}{Cartesian product (Cross Product)} \\[6pt] 
+	\verb=X \cross Y=                        &    \(   X \cross Y                 \)    & \multirow{2}{*}{Cartesian product (Cross Product)} \\[6pt]
 	\verb=\Cross_{i \in \omega} X_i=         &    \(   \Cross_{i \in \omega} X_i  \)    &  \\ \midrule
 	\verb=\powset{\omega}=                   &    \(   \powset{\omega}            \)    &  Powerset \\ \midrule
 	\verb=\eset=                             &    \(   \eset                      \)    &  Emptyset abbreviation\\ \midrule
 	\verb=x \nin A=                          &    \(   x \nin A                   \)    &  not an element\\ \midrule
-	\verb=\setcmp{X}=                        &    \(   \setcmp{X}                 \)    &  Set compliment\\[6pt] 
+	\verb=\setcmp{X}=                        &    \(   \setcmp{X}                 \)    &  Set compliment\\[6pt]
 						 &	\( \setminuscmp{X} \)		    & With option \verb=minussetcmp= \\ \midrule
 	\verb=X \setminus Y=                     &    \(   X \setminus Y              \)    & Set difference \\ \midrule
 	\verb=X \symdiff Y=                      &    \(   X \symdiff Y               \)    & Symmetric difference \\ \midrule
@@ -201,29 +252,29 @@ To disable these commands pass the option \verb=nosets=.\\
 	\verb=\closure X=                        &    \(   \closure X                 \)    & Closure \\ \midrule
 		\bottomrule
 	\end{tabular}          \\
-	
-\subsection{Delimiters}      
+
+\subsection{Delimiters}
 To disable these commands pass the option \verb=nodelim=. \\
 
-\begin{tabular}{l |  l | l}\toprule                                
-	\verb=\gcode{\phi}= 				& \multirow{3}{*}{\( \gcode{\phi} \)} & \multirow{3}{*}{Godel Code/Corner Quotes}\\ 
+\begin{tabular}{l |  l | l}\toprule
+	\verb=\gcode{\phi}= 				& \multirow{3}{*}{\( \gcode{\phi} \)} & \multirow{3}{*}{Godel Code/Corner Quotes}\\
 	\tab \verb=\godelnum{\phi}=			& &\\
 	\tab \verb=\cornerquote{\phi}=			& &\\ \midrule
 	\verb=\llangle x,y,z \rrangle=			& \( \llangle x,y,z \rrangle \) & Properly spaced double angle brackets\\
 	\bottomrule
-\end{tabular}  
+\end{tabular}
 
-\subsection{Recursive vs. Computable}      
+\subsection{Recursive vs. Computable}
 To disable these commands pass the option \verb=nonames=. To use recursive, r.e. and recursively enumerable everywhere pass the option \verb=re=.  To use computable, c.e. and computably enumerable everywhere pass the option \verb=ce=.  To force REA and CEA use the options \verb=rea= and \verb=cea=. If none of these options are passed the macros will expand as below.  All macros in this section work in both text and math modes.\\
 
-\begin{tabular}{l |  l }\toprule  
-\verb=\re=				 & \re			       \\ \midrule 
+\begin{tabular}{l |  l }\toprule
+\verb=\re=				 & \re			       \\ \midrule
 \verb=\ce=                               & \ce                         \\ \midrule
 \verb=\REA=                              & \REA                        \\ \midrule
 \verb=\CEA=                              & \CEA                        \\ \midrule
 \verb=\recursive=                        & \recursive                  \\ \midrule
 \verb=\computable=                       & \computable                 \\ \midrule
-\verb=\recursivelyEnumerable=            & \recursivelyEnumerable      \\ \midrule             
+\verb=\recursivelyEnumerable=            & \recursivelyEnumerable      \\ \midrule
 \verb=\computablyEnumerable=             & \computablyEnumerable       \\ \midrule
 \verb=\Recursive=                        & \Recursive                  \\ \midrule
 \verb=\Computable=                       & \Computable                 \\ \midrule
@@ -232,10 +283,10 @@ To disable these commands pass the option \verb=nonames=. To use recursive, r.e.
 	\bottomrule
 \end{tabular}
 
-\subsection{Quantifiers \& Connectives}      
+\subsection{Quantifiers \& Connectives}
 To disable these commands pass the option \verb=noquants=. The commands \verb=\exists= and \verb=\forall= are standard but the package extends them.\\
 
-\begin{tabular}{l |  l | l}\toprule                                
+\begin{tabular}{l |  l | l}\toprule
 	\verb=\exists[x < y]=		& \( \exists[x < y ] \) & \\[6pt]
 	\verb=\exists(x < y)=		& \( \exists(x < y ) \) & \\ \midrule
 	\verb=\exists*=		& \multirow{2}{*}{\( \exists* \)} & \\[6pt]
@@ -259,28 +310,28 @@ To disable these commands pass the option \verb=noquants=. The commands \verb=\e
 	\verb=\Land \phi_i=				& \( \Land \phi_i \) & Operator form of and\\ \midrule
 	\verb=\Lor \phi_i=				& \( \Lor \phi_i \) & Operator form of or\\ \midrule
 	\verb=\LLand \phi_i=				& \( \LLand \phi_i \) & Infinitary conjunction\\ \midrule
-	\verb=\LLor \phi_i=				& \( \LLor \phi_i \) & Infinitary disjunction\\ 
+	\verb=\LLor \phi_i=				& \( \LLor \phi_i \) & Infinitary disjunction\\
 	\bottomrule
 \end{tabular}
-\subsection{Spaces}      
+\subsection{Spaces}
 To disable these commands pass the option \verb=nospaces=.\\
 
-\begin{tabular}{l |  l | l}\toprule  
+\begin{tabular}{l |  l | l}\toprule
 	\verb=\bstrs=		       & \( \bstrs  \) & Finite binary strings        \\	\midrule
 	\verb=\wstrs=                 & \( \wstrs  \) & Finite sequences of integers \\ 	\midrule
 	\verb=\cantor=                & \( \cantor \) & Cantor space		     \\    \midrule
-	\verb=\baire=                 & \( \baire  \) & Baire space                  \\[6pt] 
-	\verb=\Baire=                 & \( \Baire  \) & Alternate baire space        \\ 
+	\verb=\baire=                 & \( \baire  \) & Baire space                  \\[6pt]
+	\verb=\Baire=                 & \( \Baire  \) & Alternate baire space        \\
 		\bottomrule
 	\end{tabular}
-	
-\subsection{Strings}      
+
+\subsection{Strings}
 To disable these commands pass the option \verb=nostrings=.\\
 
-\begin{tabular}{l |  l | l}\toprule  
-	\verb=\str{1,0,1}=		     & \(   \str{1,0,1}           \) & \multirow{2}{*}{Strings/Codes for strings}  \\ 
+\begin{tabular}{l |  l | l}\toprule
+	\verb=\str{1,0,1}=		     & \(   \str{1,0,1}           \) & \multirow{2}{*}{Strings/Codes for strings}  \\
 	\tab \verb=\code{5,8,13}=                & \(   \code{5,8,13}         \) &   \\ \midrule
-	\verb=\EmptyStr=                    & \(   \EmptyStr             \) &  \multirow{2}{*}{Empty string}  \\[6pt] 
+	\verb=\EmptyStr=                    & \(   \EmptyStr             \) &  \multirow{2}{*}{Empty string}  \\[6pt]
 	\tab \verb=\estr=                        & \(   \estr                 \) &   \\ \midrule
 	\verb=\decode{\sigma}{3}=           & \(   \decode{\sigma}{3}    \) & Alternate notation for \( \sigma(3) \)   \\ \midrule
 	\verb=\sigma\concat\tau=            & \(   \sigma\concat\tau     \) & \multirow{2}{*}{Concatenation}   \\[6pt]
@@ -292,46 +343,61 @@ To disable these commands pass the option \verb=nostrings=.\\
 	\verb=\sigma \compat \tau=          & \(   \sigma \compat \tau   \) &  Compatible strings \\ \midrule
 	\verb=\pair{x}{y}=                  & \(   \pair{x}{y}           \) & Code for the pair \( (x,y) \)  \\ \midrule
 	\verb=\setcol{X}{n}=                & \(   \setcol{X}{n}         \) & \( \set{y}{\pair{n}{y} \in X} \)  \\ \midrule
-	\verb=\setcol{X}{\leq n}=           & \(   \setcol{X}{\leq n}    \) & \( \set{ \pair{x}{y}}{\pair{x}{y} \in X \land x \leq n} \)   \\ 
+	\verb=\setcol{X}{\leq n}=           & \(   \setcol{X}{\leq n}    \) & \( \set{ \pair{x}{y}}{\pair{x}{y} \in X \land x \leq n} \)   \\
 		\bottomrule
 	\end{tabular}
-	
-\subsection{Trees}      
+
+\subsection{Subfunctions}
+To disable these commands pass the option \verb=nosubfuns=.\\
+
+\begin{tabular}{l |  l | l}\toprule
+	\verb=f \subfun g=		       & \( f \subfun g \) & \multirow{8}{*}{Varities of the function extension relation}        \\	\midrule
+	\verb=f \supfun g=		       & \( f \supfun g \) &  \\ 	\midrule
+	\verb=f \nsubfun g=		       & \( f \nsubfun g \) & \\	\midrule
+\verb=f \nsupfun g=		       & \( f \nsupfun g \) & \\	\midrule
+	\verb=f \subfuneq g=		       & \( f \subfuneq g \) & \\	\midrule
+	\verb=f \supfuneq g=		       & \( f \supfuneq g \) &  \\ 	\midrule
+	\verb=f \nsubfuneq g=		       & \( f \nsubfuneq g \) & \\	\midrule
+\verb=f \nsupfuneq g=		       & \( f \nsupfuneq g \) & \\	\midrule
+		\bottomrule
+	\end{tabular}
+
+\subsection{Trees}
 To disable these commands pass the option \verb=notrees=.\\
 
-\begin{tabular}{l |  l | l}\toprule  	
-	\verb=\CBderiv{T}=		      & \(  \CBderiv{T}		      \) & \multirow{2}{*}{Cantor-Bendixson Derivative} \\[6pt] 
+\begin{tabular}{l |  l | l}\toprule
+	\verb=\CBderiv{T}=		      & \(  \CBderiv{T}		      \) & \multirow{2}{*}{Cantor-Bendixson Derivative} \\[6pt]
 	\verb=\CBderiv[\alpha]{T}=           & \(  \CBderiv[\alpha]{T}       \) & \\ \midrule
 	\verb=\pruneTree{T}=                 & \(  \pruneTree{T}             \) & \( \set{\sigma \in T}{\exists(g)(g \in [T] \land \sigma \subset g)} \) \\ \midrule
-	\verb=\hgt{T}=                       & \(  \hgt{T}                   \) & \\ 
+	\verb=\hgt{T}=                       & \(  \hgt{T}                   \) & \\
 		\bottomrule
 	\end{tabular}
-	
-\subsection{Set Relations}      
+
+\subsection{Set Relations}
 To disable these commands pass the option \verb=nosetrels=.\\  Note that many of these commands are extensions of existing commands.
 
-\begin{tabular}{l |  l | l}\toprule 
-       \verb=X \subset* Y=    		& \( X \subset*    Y\)	& \multirow{2}{*}{All but finitely much of \( X \) is in \( Y \)} \\ 
+\begin{tabular}{l |  l | l}\toprule
+       \verb=X \subset* Y=    		& \( X \subset*    Y\)	& \multirow{2}{*}{All but finitely much of \( X \) is in \( Y \)} \\
    \verb=X \subseteq* Y=            & \( X \subseteq*  Y\)  & \\ \midrule
-       \verb=X \supset* Y=              & \( X \supset*    Y\)  & \multirow{2}{*}{All but finitely much of \( Y \) is in \( X \)} \\ 
+       \verb=X \supset* Y=              & \( X \supset*    Y\)  & \multirow{2}{*}{All but finitely much of \( Y \) is in \( X \)} \\
    \verb=X \supseteq* Y=            & \( X \supseteq*  Y\)  & \\ \midrule
        \verb=X \eq Y=                   & \( X \eq         Y\)  &  Macro for \verb~=~ \\ \midrule
-       \verb=X \eq* Y=                  & \multirow{2}{*}{\( X \eq*        Y\)}  & \multirow{2}{*}{Equal mod finite} \\ 
+       \verb=X \eq* Y=                  & \multirow{2}{*}{\( X \eq*        Y\)}  & \multirow{2}{*}{Equal mod finite} \\
   \tab \verb=X \eqae Y=                 & & \\ \midrule
        \verb=X \infsubset Y=            & \( X \infsubset  Y\)  & \( X \subset Y \land \card{Y \setminus X}=\omega \) \\ \midrule
        \verb=X \infsubset* Y=           & \( X \infsubset* Y\)  &  \( X \subset* Y \land \card{Y \setminus X}=\omega \) \\ \midrule
        \verb=X \infsupset Y=            & \( X \infsupset  Y\)  &  \( Y \subset X \land \card{X \setminus Y}=\omega \) \\ \midrule
        \verb=X \infsupset* Y=           & \( X \infsupset* Y\)  & \( Y \subset* X \land \card{X \setminus Y}=\omega \) \\ \midrule
        \verb=X \majsubset Y=            & \( X \majsubset  Y\)  & \( X \) is a major subset of \( Y \) \\ \midrule
-       \verb=X \majsupset Y=            & \( X \majsupset  Y\)  & \( Y \) is a major subset of \( X \) \\ 
+       \verb=X \majsupset Y=            & \( X \majsupset  Y\)  & \( Y \) is a major subset of \( X \) \\
 		\bottomrule
 	\end{tabular}
 
-\subsection{Ordinal Notations}      
+\subsection{Ordinal Notations}
 To disable these commands pass the option \verb=noordinalnotations=.\\
 
-\begin{tabular}{l |  l | l}\toprule 
-	\verb=\wck=			        & \( 	\wck                      \)			       & First non-computable ordinal \\ \midrule 
+\begin{tabular}{l |  l | l}\toprule
+	\verb=\wck=			        & \( 	\wck                      \)			       & First non-computable ordinal \\ \midrule
 	\verb=\ordzero=                        & \( 	\ordzero                   \)                          & Notation for ordinal \( 0 \)\\ \midrule
 	\verb=\abs{\alpha}=			& \( \abs{\alpha} \)						& Ordinal \( \alpha \) denotes \\ \midrule
 	\verb=\kleeneO=                        & \multirow{2}{*}{\( 	\kleeneO                   \)}         & \multirow{2}{*}{Set of ordinal notations} \\[6pt]
@@ -351,78 +417,79 @@ To disable these commands pass the option \verb=noordinalnotations=.\\
 	\verb=\alpha \kleeneMul  \beta=        & \( 	\alpha \kleeneMul  \beta   \)                          & Effective multiplication of notations \\  \midrule
 	\verb=\kleenelim{\lambda}{n}=          & \( 	\kleenelim{\lambda}{n}     \)                          & The \( n \)-th element in effective limit defining notation \( \lambda \)\\  \midrule
         \verb=\kleenepred{\alpha}=             & \(  \kleenepred{\alpha}          \)                          & Predecessor of \( \alpha \) if defined \\ \midrule
-	\verb=\kleenehgt{R}=                   & \multirow{2}{*}{\( 	\kleenehgt{R}              \)}        & Heigh of computable relation \( R \) \\ 
-\tab	\verb=\hgtO{R}=                        & & \\ 
+	\verb=\kleenehgt{R}=                   & \multirow{2}{*}{\( 	\kleenehgt{R}              \)}        & Heigh of computable relation \( R \) \\
+\tab	\verb=\hgtO{R}=                        & & \\
 		\bottomrule
 	\end{tabular}
-	
-\subsection{Forcing}      
-To disable these commands pass the option \verb=noforcing=.\\ 
-
-\begin{tabular}{l |  l | l}\toprule 
-	\verb=\sigma \forces \phi=	        	& \multirow{2}{*}{\(  \sigma \forces \phi         \)}	& \multirow{2}{*}{\( \sigma \) forces \( \phi \)}\\ 
-	\tab \verb=\sigma \frc \phi=                        &    & \\ 
-	\verb=\sigma \forces(X) \phi=               & \(  \sigma \forces(X)[T] \phi    \)   & \( \phi \) is formula relative to \( X \) \\ 
+
+\subsection{Forcing}
+To disable these commands pass the option \verb=noforcing=.\\
+
+\begin{tabular}{l |  l | l}\toprule
+	\verb=\sigma \forces \phi=	        	& \multirow{2}{*}{\(  \sigma \forces \phi         \)}	& \multirow{2}{*}{\( \sigma \) forces \( \phi \)}\\
+	\tab \verb=\sigma \frc \phi=                        &    & \\
+	\verb=\sigma \forces(X) \phi=               & \(  \sigma \forces(X)[T] \phi    \)   & \( \phi \) is formula relative to \( X \) \\
 	\verb=\sigma \forces[T] \phi=               & \(  \sigma \forces(X)[T] \phi    \)   & Local forcing on \( T \)\\
-	\verb=\sigma \forces* \phi=                    & \(  \sigma \forces* \phi        \)    & Strong forcing \\ 
+	\verb=\sigma \forces* \phi=                    & \(  \sigma \forces* \phi        \)    & Strong forcing \\
 	\bottomrule
-\end{tabular}  
+\end{tabular}
 
-\subsection{Syntax}      
+\subsection{Syntax}
 To disable these commands pass the option \verb=nosyntax=.\\  All syntax classes can be relativized with an optional argument in square brackets even when not listed below.  Only the \( \Delta \) formula classes are listed below since the syntax is identical for \( \Sigma \) and \( \Pi \).  Capitalizing the first letter gives the boldface version in all cases (except the computable infinitary formulas as this doesn't make sense).  Not all formulas/abbreviations are demonstrated below given the huge number but the enough are included to make it clear what command is required to generate the desired formula class, e.g., substituting pi for delta does what you think it does.
 
-To change the syntax for the computable infinitary formulas you can pass the options \verb=cdeltasym=, \verb=csigmasym= and \verb=cpisym= set equal to the command to produce your desired symbol.  This is UNTESTED and quite likely doesn't work yet.  If you desire this feature and it doesn't work send me a bug report. 
+To change the syntax for the computable infinitary formulas you can pass the options \verb=cdeltasym=, \verb=csigmasym= and \verb=cpisym= set equal to the command to produce your desired symbol.  This is UNTESTED and quite likely doesn't work yet.  If you desire this feature and it doesn't work send me a bug report.
 
-\begin{xtabular}{l |  l | l}\toprule 
+\begin{xtabular}{l |  l | l}\toprule
 	\verb=\Cdeltan[X]{\alpha}=          & \( \Cdeltan[X]{2}    \)      & The computable \( \delta^{X}_\alpha \) formulas  \\ \midrule
 	\verb=\deltan{2}=              & \( \deltan{2}        \)      & \\ \midrule
 	\verb=\deltan[X]{2}=           & \( \deltan[X]{2}     \)      & \\ \midrule
 	\verb=\deltaZeroN[X]{2}=       & \multirow{2}{*}{\( \deltaZeroN[X]{2} \)}      & \\
 	\tab \verb=\deltazn[X]{2}=          &                              & \\ \midrule
-	\verb=\deltaZeroOne[X]=        & \multirow{2}{*}{\( \deltaZeroOne[X]  \)}      & \\ 
-	\tab \verb=\deltazi[X]=             &                              & \\ \midrule         
-	\verb=\sigmaZeroTwo[X]=        & \multirow{2}{*}{\( \deltaZeroTwo[X]  \)}      & \\ 
-	\tab \verb=\sigmazii[X]=            &                              & \\ \midrule         
-	\verb=\deltaZeroThree[X]=      & \multirow{2}{*}{\( \deltaZeroThree[X]\)}      & \\ 
-	\tab \verb=\deltaziii[X]=           &                              & \\ \midrule         
-	\verb=\deltaOneN[X]{2}=        & \multirow{2}{*}{\( \deltaOneN[X]{2}  \)}      & \\ 
-	\tab \verb=\deltaIn[X]{2}=          &                              & \\ \midrule         
-	\verb=\deltaOneOne[X]=         & \multirow{2}{*}{\( \deltaOneOne[X]   \)}      & \\ 
-	\tab \verb=\deltaIi[X]=             &                              & \\ \midrule         
-	\verb=\deltaOneTwo[X]=         & \multirow{2}{*}{\( \deltaOneTwo[X]   \)}      & \\ 
-	\tab \verb=\deltaIii[X]=            &                              & \\ \midrule         
-	\verb=\deltaOneThree[X]=       & \multirow{2}{*}{\( \deltaOneThree[X] \)}      & \\ 
-	\tab \verb=\deltaIiii[X]=           &                              & \\ \midrule  
-	\verb=\pizi=              & \( \pizi      \)      & \\ \midrule      
+	\verb=\deltaZeroOne[X]=        & \multirow{2}{*}{\( \deltaZeroOne[X]  \)}      & \\
+	\tab \verb=\deltazi[X]=             &                              & \\ \midrule
+	\verb=\sigmaZeroTwo[X]=        & \multirow{2}{*}{\( \deltaZeroTwo[X]  \)}      & \\
+	\tab \verb=\sigmazii[X]=            &                              & \\ \midrule
+	\verb=\deltaZeroThree[X]=      & \multirow{2}{*}{\( \deltaZeroThree[X]\)}      & \\
+	\tab \verb=\deltaziii[X]=           &                              & \\ \midrule
+	\verb=\deltaOneN[X]{2}=        & \multirow{2}{*}{\( \deltaOneN[X]{2}  \)}      & \\
+	\tab \verb=\deltaIn[X]{2}=          &                              & \\ \midrule
+	\verb=\deltaOneOne[X]=         & \multirow{2}{*}{\( \deltaOneOne[X]   \)}      & \\
+	\tab \verb=\deltaIi[X]=             &                              & \\ \midrule
+	\verb=\deltaOneTwo[X]=         & \multirow{2}{*}{\( \deltaOneTwo[X]   \)}      & \\
+	\tab \verb=\deltaIii[X]=            &                              & \\ \midrule
+	\verb=\deltaOneThree[X]=       & \multirow{2}{*}{\( \deltaOneThree[X] \)}      & \\
+	\tab \verb=\deltaIiii[X]=           &                              & \\ \midrule
+	\verb=\pizi=              & \( \pizi      \)      & \\ \midrule
 	\verb=\pizn[X]{n}=              & \( \pizn[X]{n}      \)      & \\ \midrule
-	\verb=\Deltan{2}=              & \( \Deltan{2}        \)      & \\ \midrule  
+	\verb=\Deltan{2}=              & \( \Deltan{2}        \)      & \\ \midrule
 	\verb=\DeltaOneN[X]{n}=         & \( \DeltaOneN[X]{n} \)  & \\ \midrule
- 
-	\verb=\logic{\omega_1}{\omega}= & \( \logic{\omega_1}{\omega} \) & Indicates the kind of infinitary logic\\ 
+
+	\verb=\logic{\omega_1}{\omega}= & \( \logic{\omega_1}{\omega} \) & Indicates the kind of infinitary logic\\
 		\bottomrule
 \end{xtabular}
-                    
+
 \subsection{MRref}
 
-Finally to enable the mrref helper macros pass the option \verb=mrref=.\\  These macros normalize the formating of mathscinet references for supported bibliography styles and ensure the MR numbers link to the mathscinet page of the article.  Unless you have a good reason (like journal formatting guidelines) there is no reason not to always pass this option.  Note this option requires the hyperref package.                    
-	                              
-	
+Finally to enable the mrref helper macros pass the option \verb=mrref=.\\  These macros normalize the formating of mathscinet references for supported bibliography styles and ensure the MR numbers link to the mathscinet page of the article.  Unless you have a good reason (like journal formatting guidelines) there is no reason not to always pass this option.  Note this option requires the hyperref package.
+
+
 \section{Release Notes}
 
-\begin{itemize}  
+\begin{itemize}
+	\item[2.0] 09/26/2017 - Added support for introducing requirements, the subfunction relation and probably other undocumented features
 	\item[1.3] 06/20/2012 - Added abbreviations for computable infinitary formulas and made a few minor fixes.
 	\item[1.2] 01/01/2011 - Fixed awful option processing bug preventing most options from being recognized and added mrref option.
 	\item[1.0] 10/15/2010 - Initial public release
 \end{itemize}
-	
-	
-	
-	
-	
-	
-	
-	
-	
-	                                     
+
+
+
+
+
+
+
+
+
+
 
 \end{document}
\ No newline at end of file
diff --git a/Master/texmf-dist/tex/latex/rec-thy/rec-thy.sty b/Master/texmf-dist/tex/latex/rec-thy/rec-thy.sty
index 30c42cab80d..91479ca7d8e 100644
--- a/Master/texmf-dist/tex/latex/rec-thy/rec-thy.sty
+++ b/Master/texmf-dist/tex/latex/rec-thy/rec-thy.sty
@@ -1,29 +1,54 @@
 \NeedsTeXFormat{LaTeX2e}
-\newcommand*{\@curpack}{\@currname} %rec-thy.sty
-\newcommand*{\@packinfo}[1]{\PackageInfo{\@curpack}{#1}}
+\ProvidesPackage{rec-thy}[2017/09/26 v2.0  Provides commands for writing up recursion theory papers]
+\makeatletter
+% \newcommand*{\@curpack}{\@currname} %rec-thy.sty
+\newcommand*{\@packinfo}[1]{\PackageInfo{rec-thy}{#1}}
 \newcommand*{\recthy@strip}[1]{%\expandafter\newcommand{\csname #1\endcsname}{}% Makes sure arg isn't already a command
 \expandafter\edef\csname #1\endcsname{\expandafter\noexpand\csname @recthy@#1\endcsname}} %leaves us a command \arg defined to do \@recthy@arg
-\ProvidesPackage{\@curpack} [2011/01/01 v1.2  Provides commands for writing up recursion theory papers] %file name is package name
+% \ProvidesPackage{\@curpack}  %file name is package name
 
 % Release Notes
 % Version 1.2
 % Added mrref option
 % Fixed horrific option processing bug
-
+\RequirePackage{amsmath}
+\RequirePackage{ifxetex,ifpdf}
 \RequirePackage{suffix}
 \RequirePackage{ifmtarg}
 \RequirePackage{xifthen}
 \RequirePackage{xkeyval}
-\RequirePackage{undertilde}
-\RequirePackage{stmaryrd}
-\RequirePackage{amsmath}
+\RequirePackage{mathtools}
 \RequirePackage{amssymb}
-\RequirePackage{marvosym}
-\DeclareMathAlphabet{\mathbrush}{T1}{pbsi}{xl}{n}
-
-\newcommand*{\PMG@arginit}{\let\@PMG@parenarg\@PMG@undefined\let\@PMG@braketarg\@PMG@undefined}
-
-\newcommand*{\@recthy@family}{\@currname.\@currext} %The default family for this package...filename.ext
+\RequirePackage{amsfonts}
+\RequirePackage{undertilde}
+\RequirePackage{ltxcmds}
+\ltx@ifpackageloaded{unicode-math}{}{\RequirePackage{mathrsfs}}
+
+
+% \DeclareMathAlphabet{\mathbrush}{T1}{pbsi}{xl}{n}
+% \newcommand*{\mathbrush}[1]{\mathsfit{#1}}
+% \ifxetex
+%   \RequirePackage{xltxtra}
+%   \RequirePackage{unicode-math}
+%   % \RequirePackage{fontspec,xunicode}
+%   % \defaultfontfeatures{Mapping=tex-text,Scale=MatchLowercase} % To support LaTeX quoting style
+%   % \input{/Users/TruePath/Library/texmf/tex/headers/appearence.tex}
+% \else
+%   % \usepackage[utf8]{inputenc}
+%   % \usepackage[T1]{fontenc}
+%   % \RequirePackage{euscript}
+%   % \newcommand*{\matheu}{\EuScript}
+
+%   \ifpdf
+% 	\RequirePackage{cmap} % you can search in the pdf for umlauts and ligatures
+%   \fi
+% \fi
+% \RequirePackage{stmaryrd}
+% \RequirePackage{marvosym}
+
+\def\PMG@arginit{\let\@PMG@parenarg\@PMG@undefined\let\@PMG@braketarg\@PMG@undefined}
+
+\def\@recthy@family{\@currname.\@currext} %The default family for this package...filename.ext
 %Define boolean options true if option passed false otherwise
 
 
@@ -31,9 +56,11 @@
 \newif\ifrecthy@mrref			\recthy@mrreffalse
 \newif\ifrecthy@nomath			\recthy@nomathfalse
 \newif\ifrecthy@nodelim			\recthy@nodelimfalse
-\newif\ifrecthy@nonames			\recthy@nonamesfalse
-\newif\ifrecthy@nosets			\recthy@nosetsfalse
-\newif\ifrecthy@noquants		\recthy@noquantsfalse
+\newif\ifrecthy@nonames
+\recthy@nonamesfalse
+\newif\ifrecthy@nosets
+\recthy@nosetsfalse
+\newif\ifrecthy@noquants\recthy@noquantsfalse
 \newif\ifrecthy@nospaces		\recthy@nospacesfalse
 \newif\ifrecthy@nostrings		\recthy@nostringsfalse
 \newif\ifrecthy@notrees			\recthy@notreesfalse
@@ -46,28 +73,141 @@
 \newif\ifrecthy@noforcing		\recthy@noforcingfalse
 \newif\ifrecthy@nodegrees		\recthy@nodegreesfalse
 \newif\ifrecthy@nocomputations		\recthy@nocomputationsfalse
-                                                                             
-\DeclareOption{nohyphenation}{\recthy@nohyphenationtrue}
-\DeclareOption{mrref}{\recthy@mrreftrue}
-\DeclareOption{nomath}{\recthy@nomathtrue}
-\DeclareOption{nodelim}{\recthy@nodelimtrue}
-\DeclareOption{nonames}{\recthy@nonamestrue}
-\DeclareOption{nosets}{\recthy@nosetstrue}
-\DeclareOption{noquants}{\recthy@noquantstrue}
-\DeclareOption{nospaces}{\recthy@nospacestrue}
-\DeclareOption{nostrings}{\recthy@nostringstrue}
-\DeclareOption{notrees}{\recthy@notreestrue}
-\DeclareOption{nopair}{\recthy@nopairtrue}
-\DeclareOption{nosetrels}{\recthy@nosetrelstrue}
-\DeclareOption{noordinalnotations}{\recthy@noordinalnotationstrue}
-\DeclareOption{nosyntax}{\recthy@nosyntaxtrue}
-\DeclareOption{nodegclasses}{\recthy@nodegclassestrue}
-\DeclareOption{noforcing}{\recthy@noforcingtrue}
-\DeclareOption{nodegrees}{\recthy@nodegreestrue}
-\DeclareOption{nocomputations}{\recthy@nocomputationstrue}                                                                             
-
-\DeclareOption{degjoin}{\def\Tjoin{\Tdegjoin}}
-	
+\newif\ifrecthy@nostructresets \recthy@nostructresetsfalse
+\newif\ifrecthy@noreqhelper \recthy@noreqhelperfalse
+\newif\ifrecthy@nosubfun \recthy@nosubfunfalse
+\newif\ifrecthy@hyperreqs \recthy@hyperreqstrue
+
+\DeclareOptionX{nohyphenation}{\recthy@nohyphenationtrue}
+\DeclareOptionX{mrref}{\recthy@mrreftrue}
+\DeclareOptionX{nomath}{\recthy@nomathtrue}
+\DeclareOptionX{nodelim}{\recthy@nodelimtrue}
+\DeclareOptionX{nonames}{\recthy@nonamestrue}
+\DeclareOptionX{nosets}{\recthy@nosetstrue}
+\DeclareOptionX{noquants}{\recthy@noquantstrue}
+\DeclareOptionX{nospaces}{\recthy@nospacestrue}
+\DeclareOptionX{nostrings}{\recthy@nostringstrue}
+\DeclareOptionX{notrees}{\recthy@notreestrue}
+\DeclareOptionX{nopair}{\recthy@nopairtrue}
+\DeclareOptionX{nosetrels}{\recthy@nosetrelstrue}
+\DeclareOptionX{noordinalnotations}{\recthy@noordinalnotationstrue}
+\DeclareOptionX{nosyntax}{\recthy@nosyntaxtrue}
+\DeclareOptionX{nodegclasses}{\recthy@nodegclassestrue}
+\DeclareOptionX{noforcing}{\recthy@noforcingtrue}
+\DeclareOptionX{nodegrees}{\recthy@nodegreestrue}
+\DeclareOptionX{nocomputations}{\recthy@nocomputationstrue}
+\DeclareOptionX{nostructresets}{\recthy@nostructresetstrue}
+\DeclareOptionX{noreqhelper}{\recthy@noreqhelpertrue}
+\DeclareOptionX{nosubfun}{\recthy@nosubfuntrue}
+\DeclareOptionX{nohyperreqs}{\recthy@hyperreqsfalse}
+
+\DeclareOptionX{degjoin}{\def\Tjoin{\Tdegjoin}}
+
+\AtEndOfPackage{
+\ifrecthy@nosubfun
+	\@packinfo{Not loading subfun defs.}
+\else
+	\@packinfo{Loading subfun defs DOCUMENT ME.}
+	%DOCUMENT ME
+	\newcommand*{\subfun}[1][]{\prec\ifthenelse{\isempty{#1}}{_{#1}}{}}
+	\newcommand*{\supfun}[1][]{\succ\ifthenelse{\isempty{#1}}{_{#1}}{}}
+	\newcommand*{\nsubfun}[1][]{\nprec\ifthenelse{\isempty{#1}}{_{#1}}{}}
+	\newcommand*{\nsupfun}[1][]{\nsucc\ifthenelse{\isempty{#1}}{_{#1}}{}}
+	\newcommand*{\subfuneq}[1][]{\preceq\ifthenelse{\isempty{#1}}{_{#1}}{}}
+	\newcommand*{\supfuneq}[1][]{\succeq\ifthenelse{\isempty{#1}}{_{#1}}{}}
+	\newcommand*{\nsubfuneq}[1][]{\npreceq\ifthenelse{\isempty{#1}}{_{#1}}{}}
+	\newcommand*{\nsupfuneq}[1][]{\nsucceq\ifthenelse{\isempty{#1}}{_{#1}}{}}
+\fi
+}
+
+
+
+\newcommand*{\@recthy@reqscr}[1]{\mathscr{#1}}
+% \DeclareOptionX{reqscr}{\newcommand{\@recthy@reqscr}[1]{#1{##1}}}
+
+
+\AtEndOfPackage{
+\ifrecthy@noreqhelper
+	\@packinfo{Not loading requirement assist.}
+\else
+	\@packinfo{Loading requirement assist.}
+	\newcommand*{\req@orig}[3][]{\ensuremath{\ifthenelse{\isempty{#1}}{\@recthy@reqscr{#2}_{#3}}{\@recthy@reqscr{#2}^{#1}_{#3}}}}
+	\ifrecthy@hyperreqs
+		\newcommand*{\req}[3][]{
+		\@ifundefined{hyperref}{
+			\req@orig[#1]{#2}{#3}
+		}{
+			\hyperref[\detokenize{req:#2@#1}]{\req@orig[#1]{#2}{#3}}
+		}}
+	\else
+		\let\req=\req@orig
+	\fi
+	\WithSuffix\def\req*{\req@orig}
+	% \newsavebox{\@recthy@reqbox}
+	% \def\defreq#1#2\par{
+	% 	\begin{equation}\let\veqno\@@leqno%
+	% 		\tag*{#1}%
+	% 		\begin{lrbox}{\@recthy@reqbox}%
+ %   \begin{minipage}{\textwidth}#2\end{minipage}%
+ %   \end{lrbox}%
+ %   \makebox[0pt]{\usebox{\@recthy@reqbox}}%
+	% 	\end{equation}}
+	\newtagform{colon}{}{:}
+	\newenvironment{requirement}[1]{
+		\let\@origif@fleqn@pmg=\if@fleqn
+		\let\@origiftagsleft@pmg=\iftagsleft@
+		\@fleqntrue
+		\setlength\@mathmargin{1.5cm}
+		\tagsleft@true
+		\usetagform{colon}
+		% \let\maketag@@@orig@pmg=\maketag@@@
+		% \def\maketag@@@#1{\hbox{\m@th\normalfont#1:}}
+		\begin{equation}\tag{#1}
+	}{
+		\end{equation}
+		\let\if@fleqn=\@origif@fleqn@pmg
+		\let\iftagsleft@=\@origiftagsleft@pmg
+		\usetagform{default}
+		% \let\maketag@@@=\maketag@@@orig@pmg  
+	}
+
+	\newenvironment{require}[3][]{
+		\begin{requirement}{\req[#1]{#2}{#3}} \label{\detokenize{req:#2@#1}}
+	}{
+		\end{requirement}
+	}
+	\newcommand*{\refreq}[2][]{\ref{\detokenize{req:#2@#1}}}
+
+\fi
+}
+
+
+
+\AtEndOfPackage{
+\ifrecthy@nostructresets
+	\@packinfo{Not loading r.e. set structs w/ containment.}
+\else
+	\@packinfo{Loading r.e. set structs w/ containment.}
+\newcommand*{\promptdif}{\setminus_{\downarrow}}
+\let\setbefore=\promptdif
+\let\promptminus=\promptdif
+\let\promptsetminus=\promptdif
+
+\newcommand*{\StrcE}{\ensuremath{\mathscr{E}}}
+\WithSuffix\def\StrcE*{\ensuremath{\mathscr{E}^{*}}}
+\let\strucE\StrcE
+\newcommand*{\StrcL}[1]{\mathscr{L}(#1)}
+\newcommand*{\StrcStarL}[1]{\mathscr{L}^{*}(#1)}
+\WithSuffix\def\StrcL*{\StrcStarL}
+\newcommand*{\splitof}{\sqsubset}
+\newcommand*{\splitby}{\sqsupset}
+\newcommand*{\StrcR}{\ensuremath{\mathcal{R}}}
+\newcommand*{\StrcD}{\ensuremath{\mathcal{D}}}
+
+
+\fi
+}
+
 \AtEndOfPackage{
 \ifrecthy@nohyphenation
 	\@packinfo{No hyphenation loading.}
@@ -202,41 +342,43 @@
 \fi
 }
 
-\DeclareOption{reterms}{%
+\DeclareOptionX{reterms}{%
 	\let\@recthy@ce=\@recthy@re
 	\let\@recthy@computable=\@recthy@recursive
 	\let\@recthy@computablyEnumerable=\@recthy@recursivelyEnumerable
 	\let\@recthy@ComputablyEnumerable=\@recthy@RecursivelyEnumerable
 	} %Make all references to ce change to re
-	
-	\DeclareOption{reaterms}{%
+
+	\DeclareOptionX{reaterms}{%
 		\let\@recthy@CEA=\@recthy@REA
 		}
-		
-\DeclareOption{ceterms}{%
+
+\DeclareOptionX{ceterms}{%
 	\let\@recthy@re=\@recthy@ce
 	\let\@recthy@recursive=\@recthy@computable
 	\let\@recthy@recursivelyEnumerable=\@recthy@computablyEnumerable
 	\let\@recthy@RecursivelyEnumerable=\@recthy@ComputablyEnumerable
 	} %Make all references to re change to ce
 
-\DeclareOption{ceaterms}{%
+\DeclareOptionX{ceaterms}{%
 			\let\@recthy@REA=\@recthy@CEA
 			}
 % Set stuff
 
-\newcommand*{\@recthy@set}[2]{\ifthenelse{\isempty{#2}}{\left \{  #1 \right \}}{\left \{ #1 \middle | #2\right \}} }
 
+\def\@recthy@set#1{\def\@set@argi@pmg{#1}\@ifnextchar\bgroup\@setst@pmg\@setplain@pmg}
+\newcommand*{\@setst@pmg}[1]{\ifthenelse{\isempty{#1}}{\@setplain@pmg}{\left \{ \@set@argi@pmg \middle | #1\right \}}}
+\newcommand*{\@setplain@pmg}{\left \{ \@set@argi@pmg \right \}}
+% \newcommand*{\@recthy@set}[2]{\ifthenelse{\isempty{#2}}{\left \{  #1 \right \}}{\left \{ #1 \middle | #2\right \}} }
 
 \newcommand*{\@recthy@card}[1]{\lvert#1\rvert}
 \newcommand*{\@recthy@union}{\mathbin{\cup}}
 \newcommand*{\@recthy@Union}{\mathop{\bigcup}}
 \newcommand*{\@recthy@isect}{\mathbin{\cap}}
 \newcommand*{\@recthy@Isect}{\mathop{\bigcap}}
-
+\newcommand*{\@recthy@nin}{\notin}
 \newcommand*{\@recthy@powset}[1]{\mathcal{P}\left(#1\right)}
 \newcommand*{\@recthy@eset}{\emptyset}
-\newcommand*{\@recthy@nin}{\mathrel{\not\in}}
 \newcommand*{\@recthy@setcmpminusSYM}{\backsim}
 \newcommand*{\@recthy@setminuscmp}[1]{\mathop{\@recthy@setcmpminusSYM} #1}
 \newcommand*{\@recthy@setovercmp}[1]{\overline{#1}}
@@ -244,9 +386,9 @@
 \def\@recthy@setminusSYM{-}
 
 
-\DeclareOption{setminussym}{\def\@recthy@setminusSYM{#1}}
-\DeclareOption{setcmpminussym}{\def\@recthy@setminusSYM{#1}}
-\DeclareOption{minussetcmp}{\let\@recthy@setcmp=\@recthy@setminuscmp}
+\DeclareOptionX{setminussym}{\def\@recthy@setminusSYM{#1}}
+\DeclareOptionX{setcmpminussym}{\def\@recthy@setminusSYM{#1}}
+\DeclareOptionX{minussetcmp}{\let\@recthy@setcmp=\@recthy@setminuscmp}
 \newcommand*{\@recthy@setminus}{\mathbin{\@recthy@setminusSYM}}
 
 
@@ -285,26 +427,39 @@
 	\@packinfo{No quants loading.}
 \else
 	\@packinfo{Quants loading.}
-	\WithSuffix\def\exists(#1){\left(\exists\, #1 \right)\!}
-	\WithSuffix\def\forall(#1){\left(\forall\, #1 \right)\!}
-	\WithSuffix\def\nexists(#1){\left(\nexists\, #1 \right)\!}
-	\WithSuffix\def\exists[#1]{\left[\exists\, #1 \right]\!}
-	\WithSuffix\def\forall[#1]{\left[\forall\, #1 \right]\!}
-	\WithSuffix\def\nexists[#1]{\left[\nexists\, #1 \right]\!}
-	\WithSuffix\def\forall*{\forallae}
-	\WithSuffix\def\exists*{\existsinf}
-	\WithSuffix\def\nexists*{\nexistsinf}
-	
+	\newcommand*{\existsuniq}{\exists !}
+	\newcommand*{\nexistsuniq}{\nexists !}
+	\WithSuffix\def\existsuniq(#1){\left(\existsuniq\, #1 \right)\!}
+	\WithSuffix\def\nexistsuniq(#1){\left(\nexistsuniq\, #1 \right)\!}
+	\WithSuffix\def\existsuniq[#1]{\left[\existsuniq\, #1 \right]\!}
+	\WithSuffix\def\nexistsuniq[#1]{\left[\nexistsuniq\, #1 \right]\!}
+
 	\newcommand*{\forallae}{\forall^{*}}
 	\WithSuffix\def\forallae(#1){\left(\forallae\, #1\right)\!}
 	\WithSuffix\def\forallae[#1]{\left[\forallae\, #1\right]\!}
+
 	\newcommand*{\existsinf}{\exists^{\infty}}
 	\WithSuffix\def\existsinf(#1){\left(\existsinf\, #1\right)\!}
 	\WithSuffix\def\existsinf[#1]{\left[\existsinf\, #1\right]\!}
+
 	\newcommand*{\nexistsinf}{\nexists^{\infty}}
 	\WithSuffix\def\nexistsinf(#1){\left(\nexistsinf\, #1\right)\!}
 	\WithSuffix\def\nexistsinf[#1]{\left[\nexistsinf\, #1\right]\!}
 
+	\WithSuffix\def\exists(#1){\left(\exists\, #1 \right)\!}
+	\WithSuffix\def\forall(#1){\left(\forall\, #1 \right)\!}
+	\WithSuffix\def\nexists(#1){\left(\nexists\, #1 \right)\!}
+	\WithSuffix\def\exists[#1]{\left[\exists\, #1 \right]\!}
+	\WithSuffix\def\forall[#1]{\left[\forall\, #1 \right]\!}
+	\WithSuffix\def\nexists[#1]{\left[\nexists\, #1 \right]\!}
+	\WithSuffix\def\forall*{\forallae}
+	\WithSuffix\def\exists*{\existsinf}
+	\WithSuffix\def\nexists*{\nexistsinf}
+	\WithSuffix\def\exists!{\existsuniq}
+
+
+
+
 	\newcommand*{\True}{\top}
 	\newcommand*{\False}{\bot}
 
@@ -344,10 +499,11 @@
 %Strings
 
 \newcommand*{\@recthy@EmptyStr}{\lambda}
-\newcommand*{\@recthy@concatSYM}{\hat{}}
-\DeclareOptionX<\@recthy@family>{emptystr}[]{\def\@recthy@EmptyStr{#1}}
-\DeclareOptionX<\@recthy@family>{concat}[]{\def\@recthy@concatSYM{#1}}
-
+\newcommand*{\@recthy@concatSYM}{\hat{\;}}
+% \DeclareOptionX<\@recthy@family>{emptystr}[]{\def\@recthy@EmptyStr{#1}}
+% \DeclareOptionX<\@recthy@family>{concat}[]{\def\@recthy@concatSYM{#1}}
+\DeclareOptionX{emptystr}{\def\@recthy@EmptyStr{#1}}
+\DeclareOptionX{concat}{\def\@recthy@concatSYM{#1}}
 
 \AtEndOfPackage{
 \ifrecthy@nostrings
@@ -412,7 +568,7 @@
 	\WithSuffix\def\subset*{\subset^{*}}
 	\WithSuffix\def\supset*{\supset^{*}}
 	\WithSuffix\def\subseteq*{\subseteq^{*}}
-	\WithSuffix\def\supseteq*{\supseteq^{*}}  
+	\WithSuffix\def\supseteq*{\supseteq^{*}}
 	\providecommand*{\nsupset}{\not\supset}
 	\providecommand*{\nsubset}{\not\subset}
 	\WithSuffix\def\nsubset*{\nsubset^{*}}
@@ -461,8 +617,8 @@
 \newcommand*{\wck}{\ensuremath{\omega^{ck}_1}}
   % \newcommand*{\ordtype}[1]{\ensuremath{\@recthy@abs{#1}_{\kleeneO}}}
 	\newcommand*{\ordzero}{\ensuremath{0}}
-	
-	\newcommand*{\kleeneO}{\let\@PMG@parenarg\@PMG@undefined\let\@PMG@braketarg\@PMG@undefined\def\kleeneOSYM{\mathcal{O}}\@kleeneObody}
+  \def\kleeneOSYM{\mathcal{O}}
+	\newcommand*{\kleeneO}{\let\@PMG@parenarg\@PMG@undefined\let\@PMG@braketarg\@PMG@undefined\@kleeneObody}
 	\newcommand*{\@kleeneObody}{\kleeneOSYM\ifdefined\@PMG@parenarg
 	^{\@PMG@parenarg}%
 	\fi%
@@ -472,7 +628,9 @@
 	\WithSuffix\def\@kleeneObody(#1){\def\@PMG@parenarg{#1}\@kleeneObody}
 	\WithSuffix\def\@kleeneObody[#1]{\def\@PMG@braketarg{#1}\@kleeneObody}
 	\WithSuffix\def\@kleeneObody*{\def\kleeneOSYM{\overline{\mathcal{O}}}\@kleeneObody}
-	
+
+\newcommand*{\kleeneObelow}[2][]{\kleeneOSYM_{<#2\ifthenelse{\isempty{#1}}{}{, #1}}}
+\let\kleeneOless\kleeneObelow
 
 	\newcommand*{\kleeneOuniq}{\kleeneO*}
 	\let\ordNotations=\kleeneO
@@ -495,7 +653,7 @@
 	\let\hgtO=\kleenehgt
 	\newcommand*{\kleenelim}[2]{{#1}_{[#2]}}
 	\newcommand*{\kleenepred}[1]{{#1}^{-}}
-	
+
 \fi
 }
 
@@ -531,9 +689,9 @@
 
 %%%%%%%%% Formula Classes
 
-\newcommand*{\@recthy@CDelta}{\vphantom{\Delta}^{\mathcal{C}}\Delta}
-\newcommand*{\@recthy@CSigma}{\vphantom{\Sigma}^{\mathcal{C}}\Sigma}
-\newcommand*{\@recthy@CPi}{\vphantom{\Pi}^{\mathcal{C}}\Pi}
+\newcommand*{\@recthy@CDelta}{\prescript{\mathcal{C}}{}{\Delta}}
+\newcommand*{\@recthy@CSigma}{\prescript{\mathcal{C}}{}{\Sigma}}
+\newcommand*{\@recthy@CPi}{\prescript{\mathcal{C}}{}{\Pi}}
 
 \DeclareOptionX<\@recthy@family>{cdeltasym}[]{\def\@recthy@CDelta{#1}}
 \DeclareOptionX<\@recthy@family>{csigmasym}[]{\def\@recthy@CSigma{#1}}
@@ -700,13 +858,13 @@
 
 
 
-	\newcommand*{\Cdeltan}[1]{\CDelta_{#1}}      
-	\WithSuffix\def\Cdeltan[#1]#2{\Cdeltan{#2}^{#1}} 
+	\newcommand*{\Cdeltan}[1]{\CDelta_{#1}}
+	\WithSuffix\def\Cdeltan[#1]#2{\Cdeltan{#2}^{#1}}
 	\newcommand*{\Cpin}[1]{\CPi_{#1}}
-	\WithSuffix\def\Cpin[#1]#2{\Cpin{#2}^{#1}} 
+	\WithSuffix\def\Cpin[#1]#2{\Cpin{#2}^{#1}}
 	\newcommand*{\Csigman}[1]{\CSigma_{#1}}
 	\WithSuffix\def\Csigman[#1]#2{\CSigma_{#2}^{#1}}
-	
+
         \newcommand*{\CdeltaZeroN}[1]{\Cdeltan[0]{#1}}
 	\newcommand*{\CdeltaZeroTwo}{\CdeltaZeroN{2}}
 	\newcommand*{\CdeltaZeroThree}{\CdeltaZeroN{3}}
@@ -715,8 +873,8 @@
 	\newcommand*{\CdeltaOneN}[1]{\Cdeltan[1]{#1}}
 	\newcommand*{\CdeltaOneOne}{\CdeltaOneN{1}}
 	\newcommand*{\CdeltaOneTwo}{\CdeltaOneN{2}}
-	\newcommand*{\CdeltaOneThree}{\CdeltaOneN{3}}    
-        \newcommand*{\CpiZeroN}[1]{\Cpin[0]{#1}} 
+	\newcommand*{\CdeltaOneThree}{\CdeltaOneN{3}}
+        \newcommand*{\CpiZeroN}[1]{\Cpin[0]{#1}}
 	\newcommand*{\CpiOneN}[1]{\Cpin[1]{#1}}
 	\newcommand*{\CpiOneOne}{\CpiOneN{1}}
 	\newcommand*{\CpiOneThree}{\CpiOneN{3}}
@@ -732,8 +890,8 @@
 	\newcommand*{\CsigmaZeroOne}{\CsigmaZeroN{1}}
 	\newcommand*{\CsigmaZeroThree}{\CsigmaZeroN{3}}
 	\newcommand*{\CsigmaZeroTwo}{\CsigmaZeroN{2}}
-	
-	
+
+
 	\WithSuffix\def\CsigmaOneN[#1]#2{\Csigma[1,#1]{#2}}
 	\WithSuffix\def\CsigmaOneOne[#1]{\CsigmaOneN[#1]{1}}
 	\WithSuffix\def\CsigmaOneThree[#1]{\CsigmaOneN[#1]{3}}
@@ -759,7 +917,7 @@
         \WithSuffix\def\CdeltaZeroTwo[#1]{\CdeltaZeroN[#1]{2}}
         \WithSuffix\def\CdeltaZeroThree[#1]{\CdeltaZeroN[#1]{3}}
         \WithSuffix\def\CdeltaZeroOne[#1]{\CdeltaZeroN[#1]{1}}
-           
+
 
 	%%%ABREVIATIONS
 	\newcommand*{\Cdeltaz}{\CdeltaN{0}}
@@ -789,9 +947,9 @@
 	\newcommand*{\CpiIi}{\CpiOneOne}
 	\newcommand*{\CpiIii}{\CpiOneTwo}
 	\newcommand*{\CpiIiii}{\CpiOneThree}
-	
+
 %%%BOLDFACE
-	
+
 	\newcommand*{\Deltan}[1]{\utilde{\mathbf{\Delta}}_{#1}}
 	\WithSuffix\def\Deltan[#1]#2{\utilde{\mathbf{\Delta}}^{#1}_{#2}}
 	% \WithSuffix\def\Deltan(#1)#2{\deltan{#2}\!\left(#1\right)}
@@ -919,7 +1077,7 @@
 	\newcommand*{\PiIi}{\PiOneOne}
 	\newcommand*{\PiIii}{\PiOneTwo}
 	\newcommand*{\PiIiii}{\PiOneThree}
-	
+
 
 
 
@@ -929,6 +1087,7 @@
 }
 
 
+
 %%%ABREVIATIONS
 
 
@@ -942,14 +1101,10 @@
 	\newcommand{\Low}[1][]{\ensuremath{ \text{Low}^{#1} }}
 	\newcommand{\LowN}[2][]{\ensuremath{ \text{Low}^{#1}_{#2} }}
 	\newcommand{\lowN}[2][]{\ensuremath{ \mathcal{L}^{#1}_{#2} }}
-	\newcommand{\req}[2]{\ensuremath{\mathcal{#1}_{#2}}}
 \fi
 }
 
-
-% \ProcessOptions*
-\ProcessOptionsX<\@recthy@family>
-
+\AtEndOfPackage{
 \ifrecthy@nocomputations
 	\@packinfo{No computations loading.}
 \else
@@ -970,15 +1125,53 @@
 		{\ifthenelse{\isempty{#3}}{(#4)}{(#3;#4)}%
 	}}
 
+	\newcommand*{\thetafnl}[4][]{\Theta_{#2\ifthenelse{\isempty{#1}}{}{,#1} }%
+		\ifthenelse{\isempty{#4}}%
+		{\ifthenelse{\isempty{#3}}%
+			{}% No args then print no parents
+			{(#3)}
+		}%If no oracle we just refer to the functional without any arguments
+		{\ifthenelse{\isempty{#3}}{(#4)}{(#3;#4)}%
+	}}
+
+	\newcommand*{\psifnl}[4][]{\Psi_{#2\ifthenelse{\isempty{#1}}{}{,#1} }%
+		\ifthenelse{\isempty{#4}}%
+		{\ifthenelse{\isempty{#3}}%
+			{}% No args then print no parents
+			{(#3)}
+		}%If no oracle we just refer to the functional without any arguments
+		{\ifthenelse{\isempty{#3}}{(#4)}{(#3;#4)}%
+	}}
+
+	\newcommand*{\phifnl}[4][]{\Phi_{#2\ifthenelse{\isempty{#1}}{}{,#1} }%
+		\ifthenelse{\isempty{#4}}%
+		{\ifthenelse{\isempty{#3}}%
+			{}% No args then print no parents
+			{(#3)}
+		}%If no oracle we just refer to the functional without any arguments
+		{\ifthenelse{\isempty{#3}}{(#4)}{(#3;#4)}%
+	}}
+
+	\newcommand*{\upsilonfnl}[4][]{\Upsilon_{#2\ifthenelse{\isempty{#1}}{}{,#1} }%
+		\ifthenelse{\isempty{#4}}%
+		{\ifthenelse{\isempty{#3}}%
+			{}% No args then print no parents
+			{(#3)}
+		}%If no oracle we just refer to the functional without any arguments
+		{\ifthenelse{\isempty{#3}}{(#4)}{(#3;#4)}%
+	}}
+
 
 	\newcommand*{\cequiv}{\mathrel{\backsimeq}}
 	\newcommand*{\ncequiv}{\mathrel{\not\cequiv}}
 	\newcommand*{\conv}[1][]{\mathpunct{\downarrow}_{#1}}
+	\let\converge=\conv
 	%\newcommand*{\convs}[1]{\ensuremath{\conv_{#1}}}
-	\newcommand*{\nconv}[1][]{\mathpunct{\mkern-4mu{\arrownot\mkern 4mu \downarrow}_{#1}}}
+%	\newcommand*{\nconv}[1][]{\mathpunct{\mkern-4mu{\arrownot\mkern 4mu \downarrow}_{#1}}}
+	\newcommand*{\nconv}[1][]{\mathpunct{\mkern-4mu{\smallsetminus\mkern 4mu \downarrow}_{#1}}}
 	\newcommand*{\diverge}{\mathpunct{\uparrow}}
 	% \newcommand*{\use}[2]{\mathscr{u}(#1\ifthenelse{\isempty{#2}}{}{,#2})}
-	\newcommand*{\use}[1]{\mathop{\mathbrush{u}}\!\left[{#1}\right]}
+	\newcommand*{\use}[1]{\mathop{\ltx@ifpackageloaded{unicode-math}{\mathbffrak{u}}{\mathfrak{u}}}\!\left[{#1}\right]}
 
 	\newcommand*{\REset}{\let\@PMG@parenarg\@PMG@undefined\let\@PMG@braketarg\@PMG@undefined\@REsetbody}
 	\newcommand*{\@REsetbody}[1]{W\ifdefined\@PMG@parenarg
@@ -998,7 +1191,7 @@
 	\let\iREAop=\oneREAop
 	\WithSuffix\def\reaop*#1{\oneREAop{#1}}
 	%converges
-	
+
 \fi
 
 
@@ -1009,14 +1202,14 @@
 
 
 	%%%%%%Turing Degrees
-	\newcommand*{\Tdeg}[1]{\utilde{#1}}
+	\newcommand*{\Tdeg}[1]{\utilde{\mathbf{#1}}}
 
 	\newcommand*{\Tjump}[1]{#1'}
 	\let\jump=\Tjump
 	\newcommand*{\jumpn}[2]{#1^{(#2)}}
 	\newcommand*{\jjump}[1]{#1''}
 	% \newcommand*{\Tzerosym}{\MVZero}
-	\newcommand*{\Tzerosym}{\MVZero}
+	\newcommand*{\Tzerosym}{\mathbb{0}}
 	\newcommand*{\Tzero}{{\Tzerosym}}
 	\newcommand*{\zeron}[1]{{\Tzerosym}^{(#1)}}
 	\newcommand*{\zeroj}{\jump{{\Tzerosym}}}
@@ -1067,12 +1260,17 @@
 	\newcommand*{\ttgeq}{\geq_{\@recthy@ttSYM}}
 	\newcommand*{\ttgtr}{>_{\@recthy@ttSYM}}
 	\newcommand*{\ttless}{<_{\@recthy@ttSYM}}
-	\newcommand*{\ttTleq}{\nleq_{\@recthy@ttSYM}}
-	\newcommand*{\ttTgeq}{\ngeq_{\@recthy@ttSYM}}
+	\newcommand*{\ttnleq}{\nleq_{\@recthy@ttSYM}}
+	\newcommand*{\ttngeq}{\ngeq_{\@recthy@ttSYM}}
 \fi
 
+}
+
 
 
+% \ProcessOptions*
+% \ProcessOptionsX<\@recthy@family>
+\ProcessOptionsX