Cumulativity without closure of the domain under finite unions

Reference : Cumulativity without closure of the domain under finite unions


	Document type :	Scientific journals : Article
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/15887

Title :	Cumulativity without closure of the domain under finite unions
Language :	English
Author, co-author :	Gabbay, Dov M. [King’s College London, Department of Computer Science, London, UK]
	Schlechta, K. [> >]
Publication date :	2008
Journal title :	Review of Symbolic Logic
Publisher :	Cambridge University Press
Volume :	1
Issue/season :	03
Pages :	267–304
Peer reviewed :	Yes (verified by ORBi^lu)
ISSN :	1755-0203
e-ISSN :	1755-0211
City :	Cambridge
Country :	United Kingdom
Abstract :	[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.
Permalink :	http://hdl.handle.net/10993/15887

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Open access	0808.3077.pdf		Publisher postprint	244.95 kB	View/Open

All documents in ORBi^lu are protected by a user license.