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.
|Public Domain Software
|2010–2022 Peter M. Gerdes
|Peter M. Gerdes
|TeX Live as rec-thy
MiKTeX as rec-thy
Download the contents of this package in one zip archive (140.1k).
Maybe you are interested in the following packages as well.
- semantex: Semantic, keyval-based mathematics
- semtex: Deals with stripped SemanTeX documents
- derivative: Nice and easy derivatives
- pascaltriangle: Draw beautiful Pascal (Yanghui) triangles