deepdream of
          a sidewalk
Show Answer
Math and science::Theory of Computation::Modal theory

L-formula implication

We wish to introduce an idea of implication between sets of L-formula.

First, we must generalize the idea of truth/satisfaction that was introduced for L-formula.

The idea of truth/satisfaction is recapped on the back side.

Model

Let L be a first-order language. Let U be an L-structure for L and let ϕ be an L-formula of L.

If Uϕ[s] for every [what?], then we say that U is a model of ϕ (or U models ϕ). We write Uϕ.

Extendion to sets of L-formula: if U is a model for every L-formula in a set of L-formulas, Φ, then we say U is a model of Φ, and we write UΦ.

If we compare two sets of L-formula we arrive at a type of implication.

Logical implication, under a structure

Let Δ and Γ be two sets of L-formulas from the same language L. Let U be an L-structure for L.

If UΔ implies UΓ, we say that Δ logically implies Γ under U.

In other words, if whenever all the [what?] are satisfied by U so too are the [what?].

Finally, we remove the dependency on a specific structure.

Logical implication

Let Δ and Γ be two sets of L-formulas from the same language L.

If [what?] for any [what?] of L, then we say that Δ logically implies Γ. We write this as ΔΓ.