 We will refer to logic systems by the letter \(\bL\) with possible subindices, and we set \(\bL = \langle L, \vdash_{\bL } \rangle\) and \(\bL_n = \langle L_n, \vdash_{\bL_n } \rangle\) with the understanding that \(L \; (L_n)\) is the language of \(\bL \;(\bL_n)\) and \(\vdash_{\bL }\; (\vdash_{\bL_n })\) its consequence relation. A logic system \(\bL\) is finitary if \(\vdash_{\bL}\) is a finitary consequence relation.