Again we fix an irrational α between zero and one. Since the random graphs G(n, p) with p= n -α satisfy the Zero-One Law of our Main Theorem 1.4.1 the set T α of sentences that hold almost always form a complete theory. Here we examine an axiomatization of T α and its countable models.
Unable to display preview. Download preview PDF.