Abstract
We prove an interpretation or “majorization” theorem for PA n (n≧1), the fragment of Peano Arithmetic based on ∑ 0 -induction. The theorem relies upon an asymmetric treatment of quantifiers, inspired by Girard's asymmetric rules for ID1, and it implies the well-known classification of provably recursive functions of PA n .
Sign-in/Register to access full text options 
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 callMore From: Archiv für Mathematische Logik und Grundlagenforschung
Disclaimer: 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.
