On the very weak 0-1 law for random graphs with orders
Saharon Shelah
Abstract
Let us draw a graph R on 0,1,...,n-1 by having an edge i,j with probability p(|i-j|), where sumi pi is finite and let Mn=(n,<,R). For a first order sentence psi let anpsi be the probability of ``Mn satisfies psi''. We prove that the limit of anpsi-an+1psi is 0, as n goes to infinity.
Create a lesson
Related papers
Logarithmic--exponential preparation in sharply o-minimal structures
Gal Binyamini, Oded Carmon, Dmitry Novikov
Stoic Logic and Natural Term Logic
Clarence Lewis Protin
From raw Solvability Complexity Index proofs to Weihrauch degrees
Christopher Sorg
Existence of bases implies the axiom of choice, a foundation-free proof
Gabriel Fernandes, Renan Maneli Mezabarba, Vinicius de Oliveira Rodrigues
Every countable meet-continuous lattice is Scott sober
Xiaoquan Xu, Wei Ji
A minimal type of Morley rank ω in a partial differential field
Piotr Kowalski