1 - 10 of 12 articles
Let ℰ* be the lattice of recursively enumerable sets of natural numbers modulo finite differences. We characterize the relations which can be embedded in ℰ* by using certain collections of maximal sets as domain and using Lachlan's notion of major subsets to code in the relation in certain...
In this paper we shall investigate some families of decision problems associated with a number of combinatorial systems whose alphabets are restricted to one and two letters. Our purpose is to try to gain a better understanding of the boundaries between classes of combinatorial systems whose...
We prove some theorems of general model theory and give an example of a minimal modelM having an elementary extensionN such thatM andN realize the same types.
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.