Quasi-simple relations in copies of a given recursive structure

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(97)00010-9

Other Versions

No versions found

Links

PhilArchive



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

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

O'Donnell, MJ, see Lipton, J. 187-239 Remmel, JB, see Nerode, A. 125-170.S. Feferman - 1996 - Annals of Pure and Applied Logic 81:241.
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.
BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL. [REVIEW]P. Lincoln, J. Mitchell & A. Scedrov - 1992 - Annals of Pure and Applied Logic 56:365.
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.
Knight, JF, see Ash, CJ (3).C. J. Ash - 1995 - Annals of Pure and Applied Logic 75:313.
Sufficiency conditions for theories with recursive models.Kelleen R. Hurlburt - 1992 - Annals of Pure and Applied Logic 55 (3):305-320.
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.
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
28 (#896,293)

6 months
1 (#1,604,333)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.
Turing degrees of hypersimple relations on computable structures.Valentina S. Harizanov - 2003 - Annals of Pure and Applied Logic 121 (2-3):209-226.
Generalized weak presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.

Add more citations

References found in this work

Recursive isomorphism types of recursive Boolean algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Automorphisms of substructure lattices in recursive algebra.David R. Guichard - 1983 - Annals of Pure and Applied Logic 25 (1):47-58.
Ramified systems.C. J. Ash & J. F. Knight - 1994 - Annals of Pure and Applied Logic 70 (3):205-221.
Automorphisms of supermaximal subspaces.R. G. Downey & G. R. Hird - 1985 - Journal of Symbolic Logic 50 (1):1-9.

View all 7 references / Add more references