Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

A compactness problem~

  1. Jun 18, 2009 #1
    圖片 1.JPG

    How to write down the sentences saying that c and d are far apart?

    And what's the purpose to do so for showing that there is an elementarily equivalent structure B that is not connected.

    Actually this is a question from the logic textbook " A mathematical introduction to logic " by Herbert B. Enderton.

    I post this question here since it relates to pure logic and I hope someone can give me any advice.

    Thank you.

    Sincerely
     
    Last edited: Jun 18, 2009
  2. jcsd
  3. Jun 18, 2009 #2
    For each n, let phi_n be the sentence saying that the distance between c and d is at least n. Now try applying the compactness theorem to this set of sentences.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook