Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T06:52:20.645Z Has data issue: false hasContentIssue false

Frege's unofficial arithmetic

Published online by Cambridge University Press:  12 March 2014

Agustín Rayo*
Affiliation:
Department of Logic and Metaphysics, University of St Andrews, St Andrews, KY16 9AL, UK, E-mail: ar29@st-andrews.ac.uk

Abstract

I show that any sentence of nth-order (pure or applied) arithmetic can be expressed with no loss of compositionality as a second-order sentence containing no arithmetical vocabulary, and use this result to prove a completeness theorem for applied arithmetic. More specifically. I set forth an enriched second-order language L. a sentence of L (which is true on the intended interpretation of L), and a compositionally recursive transformation Tr defined on formulas of L, and show that they have the following two properties: (a) in a universe with at least ℶn−2 objects, any formula of nth-order (pure or applied) arithmetic can be expressed as a formula of L, and (b) for any sentence of is a second-order sentence containing no arithmetical vocabulary, and

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2002

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable