Theory-relational belief revision (Q2149805)

In this paper, the authors extend the family of uniform-revision operators (originally presented by [\textit{M.-A. Williams} (ed.) and \textit{H. Rott} (ed.), Frontiers in belief revision. Dordrecht: Kluwer Academic Publishers. 165--196 (2001; Zbl 0982.00012)] and deeply studied later by \textit{T. Aravanis} [J. Log. Comput. 30, No. 7, 1357--1376 (2020; Zbl 1464.03014)]). The new family of operators is called theory-relational revision operators (TR operators, for short). TR operators are a sub-class of the AGM revision functions. Each TR operator is uniquely induced from a single fixed relation over consistent theories of the language, called strong theory-relation, which essentially encodes the dynamics of a domain. TR is presented in terms of axioms, two constructive methods (partial-meet, and epistemic-entrenchment) and a semantic in terms of preorder is provided. The extension is characterized by the standard AGM revision postulates (K*1)--(K*8) and the new postulate (TR). In terms of pre-orders, the AGM models is extended by condition (TF) and in epistemic entrenchment by condition (TE).