Arithmetical independence results using higher recursion theory
Journal of Symbolic Logic 69 (1):1-8 (2004)
| 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. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
  Try with proxy. Try with proxy. |
| Through your library | Configure |
Similar books and articlesAndrew Arana (2010). Proof Theory in Philosophy of Mathematics. Philosophy Compass 5 (4):336-347.
J. Zashev (2001). On the Recursion Theorem in Iterative Operative Spaces. Journal of Symbolic Logic 66 (4):1727-1748.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Ljubomir L. Ivanov (1989). Abstract Hierarchies and Degrees. Journal of Symbolic Logic 54 (1):16-25.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
Fabio G. Cozman (2012). Sets of Probability Distributions, Independence, and Convexity. Synthese 186 (2):577-600.
Sy D. Friedman (1983). Some Recent Developments in Higher Recursion Theory. Journal of Symbolic Logic 48 (3):629-642.
Itay Ben-Yaacov (2003). Discouraging Results for Ultraimaginary Independence Theory. Journal of Symbolic Logic 68 (3):846-850.
Vítězslav Švejdar (1983). Modal Analysis of Generalized Rosser Sentences. Journal of Symbolic Logic 48 (4):986-999.
Dick Jongh, Marc Jumelet & Franco Montagna (1991). On the Proof of Solovay's Theorem. Studia Logica 50 (1):51 - 69.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads7 ( #133,479 of 549,087 )Recent downloads (6 months)1 ( #63,317 of 549,087 )How can I increase my downloads? |
My notes
Discussion
