Pairs of computable structures

Annals of Pure and Applied Logic 46 (3):211-234 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,038

External links

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

Through your library

Similar books and articles

Embeddings of Computable Structures.Asher M. Kach, Oscar Levin & Reed Solomon - 2010 - Notre Dame Journal of Formal Logic 51 (1):55-68.
Dependent pairs.Ayhan Günaydin & Philipp Hieronymi - 2011 - Journal of Symbolic Logic 76 (2):377 - 390.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
$$\Pi^0_1$$ -Presentations of Algebras.Bakhadyr Khoussainov, Theodore Slaman & Pavel Semukhin - 2006 - Archive for Mathematical Logic 45 (6):769-781.
Spectra of Structures and Relations.Valentina S. Harizanov & Russel G. Miller - 2007 - Journal of Symbolic Logic 72 (1):324 - 348.
Effective algebraicity.Rebecca M. Steiner - 2013 - Archive for Mathematical Logic 52 (1-2):91-112.
Computable metrization.Tanja Grubba, Matthias Schröder & Klaus Weihrauch - 2007 - Mathematical Logic Quarterly 53 (4‐5):381-395.

Analytics

Added to PP
2014-04-02

Downloads
13 (#1,037,628)

6 months
6 (#522,230)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
Categoricity in hyperarithmetical degrees.C. J. Ash - 1987 - Annals of Pure and Applied Logic 34 (1):1-14.
A metatheorem for constructions by finitely many workers.J. F. Knight - 1990 - Journal of Symbolic Logic 55 (2):787-804.

Add more references