For a theory T, we say that T “implies” ϕ, or T⊨ϕ, given that for every model M⊨T we also have M⊨ϕ.
In other words, T puts enough constraints on models that each model must also guarantee ϕ.
May also write ϕ⊨ψ or ϕ⟹ϕ
Lemma: Γ⊨ϕ iff Γ∪{¬ϕ} is not satisfiable
We say that ϕ syntactically implies ψ, and write ϕ⊢ψ, if there exists a formal proof assuming ϕ and proving ψ.
A deduction ϕ from Γ is (essentially) a chain Γ⊢ψ1⊢ψ2⊢⋯⊢ψn⊢ϕ.