texlive-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.
SUSE-Public-Domaincloud_download Downloads
To download packages, you need to log in and have a valid subscription.
Please select a product to see the available package versions:
Loading...
Loading package downloads...