MarketSyncategorematic term
Company Profile

Syncategorematic term

In logic and linguistics, an expression is syncategorematic if it lacks a denotation but can nonetheless affect the denotation of a larger expression which contains it. Syncategorematic expressions are contrasted with categorematic expressions, which have their own denotations.

Ancient and medieval conception
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. ==Modern conception==
Modern conception
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==
tickerdossier.comtickerdossier.substack.com