rec-thy__doc

Commands to typeset recursion theory papers

Version:
3.8.2
Copyright:
Peter M. Gerdes
License:
pd
Packaged on:
07/30/2022 15:22:39
Number of files:
3
Size on disk:
132.97 kB

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.