Thomas J. Grilliot. Omitting types: application to recursion theory. The journal of symbolic logic, vol. 37 , pp. 81–89

Journal of Symbolic Logic 40 (1):87-88 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Omitting types: Application to recursion theory.Thomas J. Grilliot - 1972 - Journal of Symbolic Logic 37 (1):81-89.
Omitting Types: Application to Recursion Theory.Thomas J. Grilliot - 1975 - Journal of Symbolic Logic 40 (1):87-88.
Neat Embeddings, Omitting Types, and Interpolation: An Overview.Tarek Ahmed - 2003 - Notre Dame Journal of Formal Logic 44 (3):157-173.
Neat Embeddings, Omitting Types, and Interpolation: An Overview.Tarek Sayed Ahmed - 2003 - Notre Dame Journal of Formal Logic 44 (3):157-173.
Omitting types in incomplete theories.Enrique Casanovas & Rafel Farré - 1996 - Journal of Symbolic Logic 61 (1):236-245.
An omitting types theorem for saturated structures.A. D. Greif & M. C. Laskowski - 1993 - Annals of Pure and Applied Logic 62 (2):113-118.
Omitting types in set theory and arithmetic.Julia F. Knight - 1976 - Journal of Symbolic Logic 41 (1):25-32.
Omitting types for infinitary [ 0, 1 ] -valued logic.Christopher J. Eagle - 2014 - Annals of Pure and Applied Logic 165 (3):913-932.
Disturbing arithmetic.Thomas J. Grilliot - 1985 - Journal of Symbolic Logic 50 (2):375-379.

Analytics

Added to PP
2016-06-30

Downloads
22 (#703,858)

6 months
4 (#779,041)

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