Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

AML
1999

favoriteEmaildiscussreport

135views more AML 1999»

Random graphs in the monadic theory of order

13 years 4 months ago

Random graphs in the monadic theory of order

Download www.cs.tau.ac.il

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).

Shmuel Lifsches, Saharon Shelah

Real-time Traffic

AML 1999 | Monadic Theory | Random Graphs | Theory |

claim paper

Related Content

» Monadic SecondOrder Logic for Graphs Algorithmic and Language Theoretical Applications

» The monadic secondorder logic of graphs XV On a conjecture by D Seese

» Lower Bounds for the Complexity of Monadic SecondOrder Logic

» Composition of Path Transductions

» On the Expressive Power of Monadic Least Fixed Point Logic

» Merging percolation on Zd and classical random graphs Phase transition

» Modelling Calculi with Name Mobility using Graphs with Equivalences

» Almost sure convergence to consensus in Markovian random graphs

» Untestable Properties Expressible with Four FirstOrder Quantifiers

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1999
Where	AML
Authors	Shmuel Lifsches, Saharon Shelah

Comments (0)