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 [Book Review]

Journal of Symbolic Logic 58 (3):1078-1079 (1993)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275117

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,122

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

Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.
Review: Chris Ash, Julia Knight, Mark Manasse, Theodore Slaman, Generic Copies of Countable Structures. [REVIEW]Ivan N. Soskov - 1993 - Journal of Symbolic Logic 58 (3):1078-1079.
Reflection and forcing in E-recursion theory.Theodore A. Slaman - 1985 - Annals of Pure and Applied Logic 29 (1):79-106.
Enumerations in computable structure theory.Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Annals of Pure and Applied Logic 136 (3):219-246.
Π10 classes and minimal degrees.Marcia J. Groszek & Theodore A. Slaman - 1997 - Annals of Pure and Applied Logic 87 (2):117-144.
Preface.Klaus Ambos-Spies, Theodore A. Slaman & Robert I. Soare - 1998 - Annals of Pure and Applied Logic 94 (1-3):1.
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.
Constructions by transfinitely many workers.Julia F. Knight - 1990 - Annals of Pure and Applied Logic 48 (3):237-259.
On countable locally described structures.Berthold J. Maier - 1987 - Annals of Pure and Applied Logic 35 (C):205-246.
Generics for computable Mathias forcing.Peter A. Cholak, Damir D. Dzhafarov, Jeffry L. Hirst & Theodore A. Slaman - 2014 - Annals of Pure and Applied Logic 165 (9):1418-1428.
Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.
Posets of copies of countable scattered linear orders.Miloš S. Kurilić - 2014 - Annals of Pure and Applied Logic 165 (3):895-912.
Minimal first-order structures.Predrag Tanović - 2011 - Annals of Pure and Applied Logic 162 (11):948-957.
Erratum to “Ordinal notations and well-orderings in bounded arithmetic” [Annals of Pure and Applied Logic 120 (2003) 197–223]. [REVIEW]Arnold Beckmann, Samuel R. Buss & Chris Pollett - 2003 - Annals of Pure and Applied Logic 123 (1-3):291.

Analytics

Added to PP
2014-04-04

Downloads
35 (#422,020)

6 months
10 (#187,567)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references