A refactored proof of conceptual completeness
A refactored proof of conceptual completeness
A refactored proof of conceptual completeness
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Since T is consistent we may find an F-model N0 and an element a0 ∈ S N0<br />
such that a0 ∈ IR N0 for each R ∈ Γ. This means that I ∗ N0 and a0 satisfy the<br />
assumptions in the second part <strong>of</strong> the lemma, so that TI ∗ N0<br />
is consistent.<br />
A model <strong>of</strong> the latter theory consists <strong>of</strong> another F-model N1 together with<br />
an E-model homomorphism h : I ∗ N0 → I ∗ N1 such that h(a0) ∈ S N2 . Then<br />
a0 ∈ S N1 witnesses the fact that I ∗ does not stabilize S.<br />
3.10 Pro<strong>of</strong> <strong>of</strong> (c)<br />
Definition 3.11. We say that I : E → F subcovers B ∈ F if there is an object<br />
A ∈ E, a subobject S ≤ IA ∈ F and a regular epimorphism q : S ↠ B. I is<br />
subcovering if it subcovers every B ∈ F.<br />
Fix an object B ∈ F. Given an object A ∈ E, a partial function IA ⇀ B is<br />
a two-place relation ϕ ↣ IA × B such that<br />
F/(〈b, b ′ 〉 : B × B) ⊲ ϕ(a, b) ∧ ϕ(a, b ′ ) ⊢a:IA b = b ′ .<br />
Categorically speaking, ϕ is a partial function just in case the projection ϕ ↣<br />
IA × B → IA is monic.<br />
We sometimes write ϕ : IA ≥ S → B to indicate that S = (∃b : B.ϕ) is the<br />
domain <strong>of</strong> definition for ϕ. Now define<br />
Φ = {ϕ ↣ IA × B | A ∈ E, ϕ : IA ⇀ B}.<br />
Lemma 3.12. If I does not subcover B and F/B is consistent then:<br />
(i) the theory T = F/(b:B) ∪ {∃a:IA. ϕ(a, b) ⊢ ⊥ | ϕ ∈ Φ} is consistent.<br />
(ii) for any T-model 〈N, b0〉 the following theory TN is consistent:<br />
<br />
Th 1 (N) ⊕<br />
F⊕Th(I E<br />
∗N) Th 2 <br />
(N) ∪ {c 1 b0 = c2b0 ⊢ ⊥}<br />
12