Advertisement

Countable Models

  • Joel Spencer
Part of the Algorithms and Combinatorics book series (AC, volume 22)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Joel Spencer
    • 1
  1. 1.Courant InstituteNew York UniversityNew YorkUSA

Personalised recommendations