Some completeness results for stoppered and ranked classical preferential models
Karl Schlechta · Journal of Logic and Computation · 1996
We extend earlier work to stoppered (or smooth) and ranked classical preferential models, giving several soundness and completeness results for these structures. In addition, we discuss the number of copies of models needed to represent arbitrary logics defined by preferential structures.