TY - GEN
T1 - Hereditary zero-one laws for graphs
AU - Shelah, Saharon
AU - Doron, Mor
PY - 2010
Y1 - 2010
N2 - We consider the random graph on the set [n], where the probability of {x,y} being an edge is p |x-y|, and is a series of probabilities. We consider the set of all derived from by inserting 0 probabilities into, or alternatively by decreasing some of the p i . We say that hereditarily satisfies the 0-1 law if the 0-1 law (for first order logic) holds in Mnq̄ for every derived from in the relevant way described above. We give a necessary and sufficient condition on for it to hereditarily satisfy the 0-1 law.
AB - We consider the random graph on the set [n], where the probability of {x,y} being an edge is p |x-y|, and is a series of probabilities. We consider the set of all derived from by inserting 0 probabilities into, or alternatively by decreasing some of the p i . We say that hereditarily satisfies the 0-1 law if the 0-1 law (for first order logic) holds in Mnq̄ for every derived from in the relevant way described above. We give a necessary and sufficient condition on for it to hereditarily satisfy the 0-1 law.
KW - random graphs
KW - zero-one laws
UR - http://www.scopus.com/inward/record.url?scp=77956578937&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15025-8_29
DO - 10.1007/978-3-642-15025-8_29
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77956578937
SN - 3642150241
SN - 9783642150241
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 581
EP - 614
BT - Fields of Logic and Computation - Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday
T2 - 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010, and 19th EACSL Annual Conference on Computer Science Logic, CSL 2010
Y2 - 22 August 2010 through 22 August 2010
ER -