CTAN Comprehensive TeX Archive Network

CTAN update: rec-thy

Date: February 18, 2019 8:01:24 PM CET
Peter M. Gerdes submitted an update to the rec-thy package. Version number: 3.01 License type: pd Summary description: Commands to typeset recursion theory papers Announcement text:
Bugfix release 3.01
Fixed \verb=\RE= \verb=\CE= \verb=\Re= and \verb=\Ce= for the various capitalized versions. Fixed weird bug with \verb=\recfnl= no longer working based on let. Removed \verb=\interior= and \\verb=\closure= as not really appropriate commands for the package and having bugs. Also corrected version in .sty Release 3.0
This is a big upgrade and the package should now be stable and configurable enough for serious use by others. Added requirements environment for multiple requirements. Changed the \req and \require commands to take their optional argument after the first mandatory arguments as well as before. Added the commands \module and \modof. Added operator \xor. Fixed corner quotes. Added \leftofeq, \rightof, \rightofeq. Added \RE, \CE, \Ce, \Re and \Tincompat, \Tincomp, \Tcompat. Changed the way strings are symbolized and coded. Fixed commands to work even with unicode-math. Also added \require* inside \requirements. Added \nleftofeq, \nrightof, \nrightofeq, \nleftof. Commands \ancestor, \descendant, etc... and \reqof, \Astages and \Vstages now require the option suppPriorityTrees be passed to the class to use and should be viewed as depreciated. Fixed the options system so different symbols can be correctly passed to the class.
This package is located at http://mirror.ctan.org/macros/latex/contrib/rec-thy More information is at https://www.ctan.org/pkg/rec-thy
Thanks for the upload. For the CTAN Team Manfred Lotz We are supported by the TeX user groups. Please join a users group; see http://www.tug.org/usergroups.html .

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.

Version3.7 2021-03-30
Copyright2010–2021 Peter M. Gerdes
MaintainerPeter M. Gerdes



Guest Book Sitemap Contact Contact Author