A characterization theorem for injective model classes axiomatized by general rules

Abstract

We continue the work in Zhu et al. [Normal conditions for inference relations and injective models, Theoret. Comput. Sci. 309 (2003) 287-311]. A class of strict partial order structures (posets, for short) is said to be axiomatizable if the class of all injective preferential models from may be characterized in terms of general rules. This paper aims to obtain some characteristics of axiomatizable classes. To do this, a monadic second-order frame language is presented. The relationship between ℵ 0 -axiomatizability and second-order definability is explored. Then a notion of an admissible set is introduced. Based on this notion, we show that any preferential model, which does not contain any four-node substructure, must be a reduct of some injective model. Furthermore, we furnish a necessary and sufficient condition for the axiomatizability of classes of injective preferential models using general rules. Finally, we show that, in some sense, the class of all posets without any four-node substructure is the largest among axiomatizable classes.

Representation theorems for explanatory reasoning based on cumulative models

“…However, we do not know a characterization (in terms of postulates) of explanatory relations representable by injective models. The analogous question for consequence relations turned out to be difficult (see [13,21,24,25]). …”

“…The distinction between injective and non-injective representations also occurs in the study of consequence relations. The seminal KLM paper [16] dealt with the general case and Freund [13] studied the injective case (see also [21,24,25]). …”