Logical Consequence

This is all a bit basic, but worth saying because it interacts with foundational questions (for example, "what are the relata of logical consequence?" or "what is more basic, semantics or inference?"). Suppose that A={a1,a2,a3} is an alphabet. Suppose that σ1 and σ2 are non-empty strings from A. That is, they are finite sequences of the form
σi:[0,n]A.
Consider a claim of the form:
σ2 is a logical consequence of σ1.
I think this claim is seriously underspecified, because logical consequence can only make sense given a class of interpretations of the strings.

Suppose that A above is the alphabet of an interpreted language L. Suppose that this also determines a special class Sent(L) of strings, and a class Σ(L) of interpretations for L in such that way that, for any IΣ(L), and any ϕSent(L),
Iϕ
is defined, meaning,
the L-string ϕ is true in I.
Then consider the claim,
σ2 is a logical consequence in L of σ1.
On the Bolzano-Tarski definition, this means,
σ1,σ2Sent(L) and, for any L-interpretation IΣ(L),
if Iσ1 then Iσ2.

Comments