Arithmetical independence results using higher recursion theory

Journal of Symbolic Logic 69 (1):1-8 (2004)
  Copy   BIBTEX

Abstract

We extend an independence result proved in our earlier paper "Solovay's Theorem Cannot Be Simplified" (Annals of Pure and Applied Logic 112 (2001)). Our method uses the Barwise.

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1080938820

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
On the proof of Solovay's theorem.Dick de Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51-69.
Negation and partial axiomatizations of dependence and independence logic revisited.Fan Yang - 2019 - Annals of Pure and Applied Logic 170 (9):1128-1149.
Herbrand's theorem as higher order recursion.Bahareh Afshari, Stefan Hetzl & Graham E. Leigh - 2020 - Annals of Pure and Applied Logic 171 (6):102792.
Solovay's theorem cannot be simplified.Andrew Arana - 2001 - Annals of Pure and Applied Logic 112 (1):27-41.
A general condition for collapse results.Michael A. Taitslin - 2001 - Annals of Pure and Applied Logic 113 (1-3):323-330.
Erratum to: “Some model-theoretic results in the algebraic theory of quadratic forms” [Ann. Pure Appl. Logic 112 (2–3) (2001) 189–223]. [REVIEW]Vincent Astier - 2009 - Annals of Pure and Applied Logic 160 (1):127-128.
Riesz representation theorem, Borel measures and subsystems of second-order arithmetic.Xiaokang Yu - 1993 - Annals of Pure and Applied Logic 59 (1):65-78.
Independence over arbitrary sets in NSOP1 theories.Jan Dobrowolski, Byunghan Kim & Nicholas Ramsey - 2022 - Annals of Pure and Applied Logic 173 (2):103058.
Induced and higher-dimensional stable independence.Michael Lieberman, Jiří Rosický & Sebastien Vasey - 2022 - Annals of Pure and Applied Logic 173 (7):103124.

Analytics

Added to PP
2009-01-28

Downloads
76 (#213,058)

6 months
19 (#181,829)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Andrew Arana
Université de Lorraine

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Solovay's theorem cannot be simplified.Andrew Arana - 2001 - Annals of Pure and Applied Logic 112 (1):27-41.
Large discrete parts of the e-tree.Harold Simmons - 1988 - Journal of Symbolic Logic 53 (3):980-984.

Add more references