Cumulativity without closure of the domain under finite unions

[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.

Disciplines :

Computer science

Identifiers :

UNILU:UL-ARTICLE-2009-265

Author, co-author :

Gabbay, Dov M. ; King’s College London, Department of Computer Science, London, UK

Schlechta, K.

Language :

English

Title :

Cumulativity without closure of the domain under finite unions

Publication date :

2008

Journal title :

Review of Symbolic Logic

ISSN :

1755-0211

Publisher :

Cambridge University Press, Cambridge, United Kingdom

Volume :

Issue :

Pages :

267–304

Peer reviewed :

Peer Reviewed verified by ORBi

Available on ORBilu :

since 10 March 2014

Statistics

Number of views

21 (2 by Unilu)

Number of downloads

76 (0 by Unilu)

More statistics

Scopus citations^®

Scopus citations^®
without self-citations

WoS citations^™