- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
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.Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Modal analysis of generalized Rosser sentences.Vítězslav Švejdar - 1983 - Journal of Symbolic Logic 48 (4):986-999.
Discouraging results for ultraimaginary independence theory.Itay Ben-Yaacov - 2003 - Journal of Symbolic Logic 68 (3):846-850.
Some recent developments in higher recursion theory.Sy D. Friedman - 1983 - Journal of Symbolic Logic 48 (3):629-642.
Sets of probability distributions, independence, and convexity.Fabio G. Cozman - 2012 - Synthese 186 (2):577-600.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
Abstract hierarchies and degrees.Ljubomir L. Ivanov - 1989 - Journal of Symbolic Logic 54 (1):16-25.
Axiomatic recursion theory and the continuous functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.
On the recursion theorem in iterative operative spaces.J. Zashev - 2001 - Journal of Symbolic Logic 66 (4):1727-1748.
On the proof of Solovay's theorem.Dick Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51 - 69.
Analytics
Added to PP
2009-01-28
Downloads
74 (#218,767)
6 months
17 (#141,290)
2009-01-28
Downloads
74 (#218,767)
6 months
17 (#141,290)
Historical graph of downloads
Author's Profile
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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo