In its modern conception, syncategorematicity is seen as a formal feature, determined by the way an expression is defined or introduced in the language. In the standard
semantics for
propositional logic, the logical connectives are treated syncategorematically. Let us take the connective \land for instance. Its semantic rule is: : \lVert \phi \land \psi \rVert = 1 iff \lVert \phi \rVert = \lVert \psi \rVert = 1 Thus, its meaning is defined when it occurs in combination with two formulas \phi and \psi. It has no meaning when taken in isolation, i.e. \lVert \land \rVert is not defined. One could however give an equivalent categorematic interpretation using
λ-abstraction: (\lambda b.(\lambda v.b(v)(b))), which expects a pair of Boolean-valued arguments, i.e., arguments that are either
TRUE or
FALSE, defined as (\lambda x.(\lambda y.x)) and (\lambda x.(\lambda y.y)) respectively. This is an expression of
type \langle \langle t, t \rangle, t \rangle. Its meaning is thus a binary function from pairs of entities of type
truth-value to an entity of type truth-value. Under this definition it would be non-syncategorematic, or categorematic. Note that while this definition would formally define the \land function, it requires the use of \lambda-abstraction, in which case the \lambda itself is introduced syncategorematically, thus simply moving the issue up another level of abstraction. ==See also==