The gärdenfors impossibility theorem in non-monotonic contexts

Studia Logica 49 (1):1 - 6 (1990)
Gärdenfors' impossibility theorem draws attention to certain formal difficulties in defining a conditional connective from a notion of theory revision, via the Ramsey test. We show that these difficulties are not avoided by taking the background inference operation to be non-monotonic.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 14,232
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Ray Reiter (1980). A Logic for Default Reasoning. Artificial Intelligence 13:81-137.
Hans Rott (1986). Ifs, Though, and Because. Erkenntnis 25 (3):345 - 370.
Citations of this work BETA
Similar books and articles

Monthly downloads

Added to index


Total downloads

8 ( #250,895 of 1,699,706 )

Recent downloads (6 months)

5 ( #128,702 of 1,699,706 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.