On the bounded monadic theory of well-ordered structures

Journal of Symbolic Logic 45 (2):334-338 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 102,785

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

Definability in well quasi-ordered sets of structures.Charles K. Landraitis - 1977 - Journal of Symbolic Logic 42 (2):289-291.
Projective Well-Orderings and Bounded Forcing Axioms.Andrés Eduardo Caicedo - 2005 - Journal of Symbolic Logic 70 (2):557 - 572.
The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
Ordered Structures and Related Concepts.Abraham Robinson - 1960 - Journal of Symbolic Logic 25 (2):170-170.
Returning to semi-bounded sets.Ya'Acov Peterzil - 2009 - Journal of Symbolic Logic 74 (2):597-617.
On dp-minimal ordered structures.Pierre Simon - 2011 - Journal of Symbolic Logic 76 (2):448 - 460.

Analytics

Added to PP
2009-01-28

Downloads
46 (#496,234)

6 months
7 (#595,433)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Undecidable Extensions of Monadic Second Order Successor Arithmetic.Dirk Siefkes - 1971 - Mathematical Logic Quarterly 17 (1):385-394.

Add more references