Abstract
This paper examines the ontological commitments of the second-order language of arithmetic and argues that they do not extend beyond the first-order language. Then, building on an argument by George Boolos, we develop a Tarski-style definition of a truth predicate for the second-order language of arithmetic that does not involve the assignment of sets to second-order variables but rather uses the same class of assignments standardly used in a definition for the first-order language.
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 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.
