Article contents
Decidability and finite axiomatizability of theories of ℵ0-categorical partially ordered sets
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1981
References
REFERENCES
- 3
- Cited by