[en] We introduce Information Bearing Relation Systems (IBRS) a
s an abstraction of many logical
systems. We then define a general semantics for IBRS, and show
that a special case of IBRS generalizes
in a very natural way preferential semantics and solves open
representation problems for weak logical
systems. This is possible, as we can ”break” the strong coher
ence properties of preferential structures
by higher arrows, i.e. arrows, which do not go to points, but t
o arrows themselves
Disciplines :
Sciences informatiques
Identifiants :
UNILU:UL-ARTICLE-2010-167
Auteur, co-auteur :
GABBAY, Dov M. ; King’s College London, Department of Computer Science, London, UK
Schlechta, Karl
Langue du document :
Anglais
Titre :
Reactive Preferential Structures and Nonmonotonic consequence
Date de publication/diffusion :
2009
Titre du périodique :
Review of Symbolic Logic
ISSN :
1755-0203
eISSN :
1755-0211
Maison d'édition :
Cambridge University Press, Cambridge, Royaume-Uni
