- 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
Ramified systems
Annals of Pure and Applied Logic 70 (3):205-221 (1994)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Bosch, R., see Bagaria, J. Cholak, P., see Ash, CJ.U. Engberg, G. Winskel, S. Ghilardi, G. Meloni, P. Matet, D. Skvortsov, S. van Bakel, L. Liquori, S. Ronchi Della Rocca & P. Urzyczyn - 1997 - Annals of Pure and Applied Logic 86:305.
Chris Ash, Julia Knight, Mark Manasse, and Theodore Slaman. Generic copies of countable structures. Annals of pure and applied logic, vol. 42 , pp. 195–205. [REVIEW]Ivan N. Soskov - 1993 - Journal of Symbolic Logic 58 (3):1078-1079.
Ash C. J. and Knight J.. Computable structures and the hyperarithmetical hierarchy. Studies in logic and the foundations of mathematics, vol. 144. Elsevier, Amsterdam etc. 2000, xv + 346 pp. [REVIEW]Valentina Harizanov - 2001 - Bulletin of Symbolic Logic 7 (3):383-385.
TERLOUW, J., Reduction of higher type levels by means of an ordinal analysis of finite terms WOOD, C., see SARACINO, D.D. Saracino - 1985 - Annals of Pure and Applied Logic 28 (1):322.
Ash, CJ, Stability of recursive structures in arithmetical degrees Ash, CJ, Categoric@ in hyperarithmetical degrees.D. Cenzer, P. Clote, R. L. Smith, S. S. Wainer, K. J. Compton, C. W. Henson & S. Shelah - 1988 - Annals of Pure and Applied Logic 40:307-310.
Ax-Schanuel and strong minimality for the j-function.Vahagn Aslanyan - 2021 - Annals of Pure and Applied Logic 172 (1):102871.
Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity.Daniel Leivant - 1999 - Annals of Pure and Applied Logic 96 (1-3):209-229.
Analytics
Added to PP
2014-01-16
Downloads
36 (#747,653)
6 months
9 (#601,551)
2014-01-16
Downloads
36 (#747,653)
6 months
9 (#601,551)
Historical graph of downloads
Citations of this work
Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures.Walker M. White & Denis R. Hirschfeldt - 2002 - Notre Dame Journal of Formal Logic 43 (1):51-64.
Computable Trees of Scott Rank [image] , and Computable Approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283 - 298.
Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.
Possible degrees in recursive copies.C. J. Ash & J. F. Knight - 1995 - Annals of Pure and Applied Logic 75 (3):215-221.
Quasi-simple relations in copies of a given recursive structure.C. J. Ash, J. F. Knight & J. B. Remmel - 1997 - Annals of Pure and Applied Logic 86 (3):203-218.
References found in this work
Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
Intrinsically gs;0alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
Labelling systems and R.E. structures.C. J. Ash - 1990 - Annals of Pure and Applied Logic 47 (2):99-119.
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-6dc498764b-55mvq uwo