Abstract
A formal presentation of the ramified theory of types of the Principia Mathematica of Russell and Whitehead is given. The treatment is inspired by but differs sharply from that in a recent paper of Kamareddine, Nederpelt and Laan. A complete algorithm for determining typability and most general polymorphic types of propositional functions of the ramified theory of types is presented, unusual in requiring reasoning about numerical inequalities in the course of deduction of type judgments (to support unification of orders). Software implementing these algorithms has been developed by the author, and examples of the use of the software are presented. This is an abridged version of a longer paper which may appear later elsewhere.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
