Commands to typeset recursion theory papers
373.14 KB
built 2026-10-18 02:55:42 GMT
Description
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.
Dependencies
24 totalRequires20
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
- rpmlib(PayloadFilesHavePrefix) <= 4.0-1
- rpmlib(PayloadIsZstd) <= 5.4.18-1
- tex(amsmath.sty)
- tex(bbm.sty)
- tex(enumitem.sty)
- tex(etoolbox.sty)
- tex(ifmtarg.sty)
- tex(ifpdf.sty)
- tex(iftex.sty)
- tex(ltxcmds.sty)
- tex(mathrsfs.sty)
- tex(picture.sty)
- tex(suffix.sty)
- tex(xifthen.sty)
- tex(xkeyval.sty)
- tex(xparse.sty)
- texlive-base
- texlive-kpathsea
Provides3
- tex(rec-thy.sty) = 2026
- texlive-rec-thy = 12:svn76924-3.fc45
- texlive-rec-thy-doc = 12:svn76924-3.fc45
Obsoletes1
- texlive-rec-thy-doc <= 11:svn76924
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
8
Files 1–8 of 8
Component of
buildroots that installed this RPMNo Buildroots
