Page "Original proof of Gödel's completeness theorem" Paragraph 10
from
Wikipedia
#* We extend this result to more and more complex and lengthy sentences, D < sub > n </ sub > ( n = 1, 2 ...), built out from B, so that either any of them is refutable and therefore so is φ, or all of them are not refutable and therefore each holds in some model.
Page 1 of 1.
2.617 seconds.