Infinitary logics and very sparse random graphs

DOI10.2307/2275550zbMath0882.03038OpenAlexW2097616873MaRDI QIDQ4358057

James F. Lynch

Publication date: 28 September 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275550

zbMATH Keywords

random graphasymptotic probabilityinfinitary languageedge probabilityfirst-order language of graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13) Other infinitary logic (03C75)

Related Items

On probabilistic elimination of generalized quantifiers

Cites Work

• The first cycles in an evolving graph
• Infinitary logics and 0-1 laws
• Structure and complexity of relational queries
• Strongly balanced graphs and random graphs
• Probabilities of Sentences about Very Sparse Random Graphs
• An extension of 0‐1 laws
• Random Resource Allocation Graphs and the Probability of Deadlock
• Expected deadlock time in a multiprocessing system
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations