Abstract valuation semantics (Q368484): Difference between revisions

The paper provides a revision of the approach suggested by the authors in [Fundam. Inform. 106, No. 2--4, 191--209 (2011; Zbl 1271.03092)]. A (many-sorted) signature is a pair \(\Sigma =(S,F)\) where \(S\) is a set (of sorts) and \(F = \{F_{ws}\}_{w \in S^*,s \in S}\) is an indexed family of sets (of operation symbols). Let \(\phi \in S\) be a distinguished (syntactic) sort and \(L_\Sigma(X)\) be a set of formulas, that is, \(L_\Sigma(X)\) is a carrier of the absolutely free algebra \(\mathbf{T_\Sigma(X)}\) with (countable) set of generators \(X\). A (many-sorted) logic is a tuple \(\mathcal{L} = \langle \Sigma, \vdash \rangle\) where \(\Sigma\) is a signature and \(\vdash\) is a structural (single-conclusion) consequence relation on \(L_\Sigma\). In a natural way, the notions of valuation and logical matrix can be extended to many-sorted logics. In Section 3, generalizations of Leibnitz and Suszko congruences as well as algebraic properties of matrices are studied, and this opens the gates to studying the algebraic semantics. Section 4 is devoted to applications to behavioral logics.