Decidability and ℵ0-categoricity of theories of partially ordered sets

Journal of Symbolic Logic 45 (3):585 - 611 (1980)
Abstract
This paper is primarily concerned with ℵ 0 -categoricity of theories of partially ordered sets. It contains some general conjectures, a collection of known results and some new theorems on ℵ 0 -categoricity. Among the latter are the following. Corollary 3.3. For every countable ℵ 0 -categorical U there is a linear order of A such that $(\mathfrak{U}, is ℵ 0 -categorical. Corollary 6.7. Every ℵ 0 -categorical theory of a partially ordered set of finite width has a decidable theory. Theorem 7.7. Every ℵ 0 -categorical theory of reticles has a decidable theory. There is a section dealing just with decidability of partially ordered sets, the main result of this section being. Theorem 8.2. If $(P, is a finite partially ordered set and K P is the class of partially ordered sets which do not embed $(P, , then Th(K P ) is decidable iff K P contains only reticles
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273425
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,495
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
The Structure of the Models of Decidable Monadic Theories of Graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
207 ( #20,960 of 2,210,644 )

Recent downloads (6 months)
1 ( #357,513 of 2,210,644 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature