Omitting types in incomplete theories

Journal of Symbolic Logic 61 (1):236-245 (1996)
We characterize omissibility of a type, or a family of types, in a countable theory in terms of non-existence of a certain tree of formulas. We extend results of L. Newelski on omitting $ non-isolated types. As a consequence we prove that omissibility of a family of $ types is equivalent to omissibility of each countable subfamily
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275607
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,661
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

9 ( #254,415 of 1,726,249 )

Recent downloads (6 months)

3 ( #231,316 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.