Priority arguments in the continuous R. E. degrees
Journal of Symbolic Logic 50 (3):661-667 (1985)
| Abstract | We show that at each type k ≥ 2, there exist c-irreducible functionals of c-r.e. degree, as defined in [Nor 1]. Our proofs are based on arguments due to Hinman, [Hin 1], and Dvornikov, [Dvo 1] | |||||||||
| 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,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesPaul Shafer (2010). Characterizing the Join-Irreducible Medvedev Degrees. Notre Dame Journal of Formal Logic 52 (1):21-38.
David Christensen (1996). Dutch-Book Arguments Depragmatized: Epistemic Consistency for Partial Believers. Journal of Philosophy 93 (9):450-479.
Peter Cholak, Rod Downey & Stephen Walk (2002). Maximal Contiguous Degrees. Journal of Symbolic Logic 67 (1):409-437.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Dag Normann (2000). Computability Over the Partial Continuous Functionals. Journal of Symbolic Logic 65 (3):1133-1142.
Guohua Wu (2004). Bi-Isolation in the D.C.E. Degrees. Journal of Symbolic Logic 69 (2):409 - 420.
M. Lerman (2010). A Framework for Priority Arguments. Cambridge University Press.
John Pollock (2001). ``Defeasible Reasoning with Variable Degrees of Justification&Quot. Artificial Intelligence 133:233-282.
Joseph S. Miller (2004). Degrees of Unsolvability of Continuous Functions. Journal of Symbolic Logic 69 (2):555 - 584.
Peter G. Hinman (1973). Degrees of Continuous Functionals. Journal of Symbolic Logic 38 (3):393-395.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
