Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Random graphs in the monadic theory of order

Random graphs in the monadic theory of order We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the monadic theory of all chains. It is provable from ZFC that the theory of random graphs is not interpretable in the monadic second order theory of short chains (hence, in the monadic theory of the real line). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Random graphs in the monadic theory of order

Loading next page...
 
/lp/springer-journals/random-graphs-in-the-monadic-theory-of-order-4r2BoUxFER

References (11)

Publisher
Springer Journals
Copyright
Copyright © 1999 by Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/s001530050129
Publisher site
See Article on Publisher Site

Abstract

We continue the works of Gurevich-Shelah and Lifsches-Shelah by showing that it is consistent with ZFC that the first-order theory of random graphs is not interpretable in the monadic theory of all chains. It is provable from ZFC that the theory of random graphs is not interpretable in the monadic second order theory of short chains (hence, in the monadic theory of the real line).

Journal

Archive for Mathematical LogicSpringer Journals

Published: May 1, 1999

There are no references for this article.