rec-thy__source
Commands to typeset recursion theory papers
- Version:
- 4.0
- Copyright:
- Peter M. Gerdes
- License:
- pd
- Packaged on:
- 04/11/2024 09:06:24
- Number of files:
- 2
- Size on disk:
- 65.04 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.