Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets

Journal of Symbolic Logic 46 (1):101 - 120 (1981)
Abstract
Every ℵ 0 -categorical partially ordered set of finite width has a finitely axiomatizable theory. Every ℵ 0 -categorical partially ordered set of finite weak width has a decidable theory. This last statement constitutes a major portion of the complete (with three exceptions) characterization of those finite partially ordered sets for which any ℵ 0 -categorical partially ordered set not embedding one of them has a decidable theory
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273263
Options
 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
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 25,751
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

Monthly downloads

Added to index

2009-01-28

Total downloads

14 ( #320,250 of 2,146,869 )

Recent downloads (6 months)

1 ( #385,701 of 2,146,869 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums