Syncategorematic term

In scholastic logic, a syncategorematic term (or syncategorema) is a word that cannot serve as the subject or the predicate of a proposition, and thus cannot stand for any of Aristotle's categories, but can be used with other terms to form a proposition. Words such as 'all', 'and', 'if' are examples of such terms.

Grammar and logic

The distinction between categorematic and syncategorematic terms was established in ancient Greek grammar. Words that designate self-sufficient entities (i.e., nouns or adjectives) were called categorematic, and those that do not stand by themselves were dubbed syncategorematic, (i.e., prepositions, logical connectives, etc.). Priscian in his Institutiones grammaticae translates the word as consignificantia. Scholastics retained the difference, which became a dissertable topic after the 13th century revival of logic. William of Sherwood, a representative of terminism, wrote a treatise called Syncategoremata. Later his pupil, Peter of Spain, produced a similar work entitled Syncategoreumata.

Propositional calculus

In propositional calculus, a syncategorematic term is a term that has no individual meaning (a term with an individual meaning is called categorematic). Whether a term is syncategorematic or not is determined by the way it is defined or introduced in the language.

In the common definition of propositional logic, examples of syncategorematic terms are the logical connectives. 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$

So its meaning is defined when it occurs in combination with two formulas $\phi$ and $\psi$. But it has no meaning when taken in isolation, i.e. $\lVert \land \rVert$ is not defined.

We could however define the $\land$ in a different manner, e.g., 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

• John Pagus
• William of Sherwood
• Supposition theory

References

• Grant, Edward, God and Reason in the Middle Ages, Cambridge University Press (July 30, 2001), ISBN 978-0-521-00337-7.