rec-thy – Commands to typeset recursion theory papers
This package is designed to help mathematicians publishing papers in the area of recursion theory (aka Computability Theory) easily use standard notation. This includes easy commands to denote Turing reductions, Turing functionals, c.e. sets, stagewise computations, forcing and syntactic classes.
|Licenses||Public Domain Software|
|Copyright||2010–2020 Peter M. Gerdes|
|Maintainer||Peter M. Gerdes|
|Contained in||TeX Live as rec-thy|
MiKTeX as rec-thy
Download the contents of this package in one zip archive (126.5k).