More on monadic logic. part C: Monadically interpreting in stable unsuperstable ℱ and the monadic theory of {Mathematical expression}

Saharon Shelah

doi:10.1007/BF02801469

More on monadic logic. part C: Monadically interpreting in stable unsuperstable ℱ and the monadic theory of {Mathematical expression}

Saharon Shelah^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

We continue investigating the strength of monadic logic in elementary classes. Mainly we show that all stable unsuperstable theories with finite vocabulary are either among the (easily definable class of) hopelessly complicated or are essentially as complicated as a variant of the tree {Mathematical expression}.

Original language	English
Pages (from-to)	353-364
Number of pages	12
Journal	Israel Journal of Mathematics
Volume	70
Issue number	3
DOIs	https://doi.org/10.1007/BF02801469
State	Published - Oct 1990

Access to Document

10.1007/BF02801469

Cite this

@article{2476a59b98cd4d19bc71aa5b6a7fb6ac,

title = "More on monadic logic. part C: Monadically interpreting in stable unsuperstable ℱ and the monadic theory of \{Mathematical expression\}",

abstract = "We continue investigating the strength of monadic logic in elementary classes. Mainly we show that all stable unsuperstable theories with finite vocabulary are either among the (easily definable class of) hopelessly complicated or are essentially as complicated as a variant of the tree \{Mathematical expression\}.",

author = "Saharon Shelah",

year = "1990",

month = oct,

doi = "10.1007/BF02801469",

language = "אנגלית",

volume = "70",

pages = "353--364",

journal = "Israel Journal of Mathematics",

issn = "0021-2172",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - More on monadic logic. part C

T2 - Monadically interpreting in stable unsuperstable ℱ and the monadic theory of {Mathematical expression}

AU - Shelah, Saharon

PY - 1990/10

Y1 - 1990/10

N2 - We continue investigating the strength of monadic logic in elementary classes. Mainly we show that all stable unsuperstable theories with finite vocabulary are either among the (easily definable class of) hopelessly complicated or are essentially as complicated as a variant of the tree {Mathematical expression}.

AB - We continue investigating the strength of monadic logic in elementary classes. Mainly we show that all stable unsuperstable theories with finite vocabulary are either among the (easily definable class of) hopelessly complicated or are essentially as complicated as a variant of the tree {Mathematical expression}.

UR - https://www.scopus.com/pages/publications/51649152106

U2 - 10.1007/BF02801469

DO - 10.1007/BF02801469

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:51649152106

SN - 0021-2172

VL - 70

SP - 353

EP - 364

JO - Israel Journal of Mathematics

JF - Israel Journal of Mathematics

IS - 3

ER -

More on monadic logic. part C: Monadically interpreting in stable unsuperstable ℱ and the monadic theory of {Mathematical expression}

Abstract

Access to Document

Other files and links

Fingerprint

Cite this