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

Journal of Symbolic Logic 45 (3):585 - 611 (1980)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,174

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Partially ordered sets and the independence property.James H. Schmerl - 1989 - Journal of Symbolic Logic 54 (2):396-401.
ℵ0-categorical modules.Walter Baur - 1975 - Journal of Symbolic Logic 40 (2):213 - 220.
A maximal bounded forcing axiom.David Asperó - 2002 - Journal of Symbolic Logic 67 (1):130-142.
Generic graph construction.James E. Baumgartner - 1984 - Journal of Symbolic Logic 49 (1):234-240.
On ℵ0-categorical nilrings. II.Gregory Cherlin - 1980 - Journal of Symbolic Logic 45 (2):291 - 301.
Stationary sets and infinitary logic.Saharon Shelah & Jouko Vaananen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.

Analytics

Added to PP
2009-01-28

Downloads
248 (#106,984)

6 months
5 (#1,050,400)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
Adding linear orders.Saharon Shelah & Pierre Simon - 2012 - Journal of Symbolic Logic 77 (2):717-725.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references