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

Categories

Keywords

Reprint years

DOI

10.2307/2273287

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

The Monadic Theory of ω 1 2.Yuri Gurevich, Menachem Magidor & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (2):387-398.
Peano arithmetic may not be interpretable in the monadic theory of linear orders.Shmuel Lifsches & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (3):848-872.
Modest theory of short chains. II.Yuri Gurevich & Saharon Shelah - 1979 - Journal of Symbolic Logic 44 (4):491-502.
Random graphs in the monadic theory of order.Shmuel Lifsches & Saharon Shelah - 1999 - Archive for Mathematical Logic 38 (4-5):273-312.
Fuzzy logic theory and applications: Part I and Part II.Lotfi A. Zadeh - 2018 - New Jersey: World Scientific. Edited by R. A. Aliev.
Model theory under the axiom of determinateness.Mitchell Spector - 1985 - Journal of Symbolic Logic 50 (3):773-780.
Proper forcing, cardinal arithmetic, and uncountable linear orders.Justin Tatch Moore - 2005 - Bulletin of Symbolic Logic 11 (1):51-60.
Monadic logic and löwenheim numbers.Saharon Shelah - 1985 - Annals of Pure and Applied Logic 28 (2):203-216.
The logic of first order intuitionistic type theory with weak sigma- elimination.M. D. G. Swaen - 1991 - Journal of Symbolic Logic 56 (2):467-483.

Analytics

Added to PP
2009-01-28

Downloads
395 (#72,384)

6 months
10 (#404,653)

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