Reference : Cumulativity without closure of the domain under finite unions
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/15887
Cumulativity without closure of the domain under finite unions
English
Gabbay, Dov M. [King’s College London, Department of Computer Science, London, UK]
Schlechta, K. [> >]
2008
Review of Symbolic Logic (The)
Cambridge University Press
1
03
267–304
Yes (verified by ORBilu)
1755-0203
1755-0211
Cambridge
United Kingdom
[en] For nonmonotonic logics, Cumulativity is an important logical rule. We show here that Cumulativity fans out into an infinity of different conditions, if the domain is not closed under finite
unions.
http://hdl.handle.net/10993/15887

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
0808.3077.pdfPublisher postprint244.95 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.