Closure properties of almost-finiteness classes in recursive function theory
Journal of Symbolic Logic 48 (3):756-763 (1983)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| 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 articlesBruno Scarpellini (2003). Comments on `Two Undecidable Problems of Analysis'. Minds and Machines 13 (1):79-85.
B. Konev, R. Kontchakov, F. Wolter & M. Zakharyaschev (2006). On Dynamic Topological and Metric Logics. Studia Logica 84 (1):129 - 160.
Dwight R. Bean (1976). Effective Coloration. Journal of Symbolic Logic 41 (2):469-480.
Stanley S. Wainer (1999). Accessible Recursive Functions. Bulletin of Symbolic Logic 5 (3):367-388.
Mark Changizi (1996). Function Identification From Noisy Data with Recursive Error Bounds. Erkenntnis 45 (1):91 - 102.
Maricarmen Martinez (2001). Some Closure Properties of Finite Definitions. Studia Logica 68 (1):43-68.
R. L. Goodstein (1961/2010). Recursive Analysis. Dover Publications.
Andrzej W. Jankowski (1984). A Conjunction in Closure Spaces. Studia Logica 43 (4):341 - 351.
Michael Huemer (2005). Logical Properties of Warrant. Philosophical Studies 122 (2):171 - 182.
T. A. Slaman (1986). ∑1 Definitions with Parameters. Journal of Symbolic Logic 51 (2):453 - 461.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,830 of 549,093 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
