Some elementary degree-theoretic reasons why structures need similarity types

Journal of Symbolic Logic 51 (3):732-747 (1986)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,597

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

Analytics

Added to PP
2009-01-28

Downloads
32 (#710,849)

6 months
9 (#500,261)

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

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Models and Ultraproducts: An Introduction.J. L. Bell & A. B. Slomson - 1972 - Journal of Symbolic Logic 37 (4):763-764.
Degrees of isolic theories.Erik Ellentuck - 1973 - Notre Dame Journal of Formal Logic 14 (3):331-340.
Degrees of Unsolvability.Joseph R. Shoenfield - 1975 - Studia Logica 34 (3):284-288.

Add more references