Modest theory of short chains. I

Journal of Symbolic Logic 44 (4):481-490 (1979)
  Copy   BIBTEX

Abstract

This is the first part of a two part work on the monadic theory of short orders (embedding neither ω 1 nor ω 1 * ). This part provides the technical groundwork for decidability results. Other applications are possible

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

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

Analytics

Added to PP
2009-01-28

Downloads
380 (#50,496)

6 months
3 (#1,023,809)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Algorithmic uses of the Feferman–Vaught Theorem.J. A. Makowsky - 2004 - Annals of Pure and Applied Logic 126 (1-3):159-213.
The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
Simple monadic theories and partition width.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (4):409-431.

Add more citations

References found in this work

No references found.

Add more references