Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T05:11:13.060Z Has data issue: false hasContentIssue false

Arithmetical independence results using higher recursion theory

Published online by Cambridge University Press:  12 March 2014

Andrew Arana*
Affiliation:
Department of Philosophy, Building 90, Stanford University, Stanford, CA 94305-2155, USA, E-mail: aarana@stanford.edu, URL: http://www.stanford.edu/~aarana

Abstract

We extend an independence result proved in [1]. We show that for all n, there is a special set of Πn sentences {φa}a ∈ H corresponding to elements of a linear ordering (H, <H) of order type . These sentences allow us to build completions {Ta}a ∈ H of PA such that for a <H b, Ta ∩ Σn ⊂ Tb ∩ Σn, with φa ∈ Ta, ¬φa ∈ Th. Our method uses the Barwise-Kreisel Compactness Theorem.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2004

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