Permitting, forcing, and copying of a given recursive relation

, &
Annals of Pure and Applied Logic 86 (3):219-236 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(96)00011-5

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,211

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

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.
Sufficiency conditions for theories with recursive models.Kelleen R. Hurlburt - 1992 - Annals of Pure and Applied Logic 55 (3):305-320.
Knight, JF, see Ash, CJ (3).C. J. Ash - 1995 - Annals of Pure and Applied Logic 75:313.
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.
AsperoH, D. and Bagaria, J., Bounded forcing axioms and the continuum (3) 179} 203 Bagaria, J., see AsperoH, D.(3) 179} 203 Balcar, B. and Simon, P., The name for Kojman} Shelah collapsing function (1} 2) 131} 137. [REVIEW]G. JaKger, R. Kahle & T. Studer - 2001 - Annals of Pure and Applied Logic 109:243.
Marcia J. Groszek. Applications of iterated perfect set forcing. Annals of pure and applied logic, vol. 39 , pp. 19– 53. [REVIEW]Andreas Blass - 1990 - Journal of Symbolic Logic 55 (1):360-361.
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.
A direct method for simulating partial recursive functions by Diophantine equations.Yuri Matiyasevich - 1994 - Annals of Pure and Applied Logic 67 (1-3):325-348.
Generalizations of enumeration reducibility using recursive infinitary propositional sentences.C. J. Ash - 1992 - Annals of Pure and Applied Logic 58 (3):173-184.

Analytics

Added to PP
2014-01-16

Downloads
22 (#1,071,209)

6 months
1 (#1,597,699)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Degree spectra of intrinsically C.e. Relations.Denis Hirschfeldt - 2001 - Journal of Symbolic Logic 66 (2):441-469.
Degree spectra of relations on computable structures.Denis R. Hirschfeldt - 2000 - Bulletin of Symbolic Logic 6 (2):197-212.

View all 6 citations / Add more citations

References found in this work

Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Intrinsically gs;0alpha; relations.E. Barker - 1988 - Annals of Pure and Applied Logic 39 (2):105-130.
Uncountable degree spectra.Valentina S. Harizanov - 1991 - Annals of Pure and Applied Logic 54 (3):255-263.

Add more references