Studia Logica 45 (2):187 - 198 (1986)

Authors
David Makinson
London School of Economics
Abstract
In some recent papers, the authors and Peter Gärdenfors have defined and studied two different kinds of formal operation, conceived as possible representations of the intuitive process of contracting a theory to eliminate a proposition. These are partial meet contraction (including as limiting cases full meet contraction and maxichoice contraction) and safe contraction. It is known, via the representation theorem for the former, that every safe contraction operation over a theory is a partial meet contraction over that theory. The purpose of the present paper is to study the relationship more finely, by seeking an explicit map between the component orderings involved in each of the two kinds of contraction. It is shown that at least in the finite case a suitable map exists, with the consequence that the relational, transitively relational, and antisymmetrically relational partial meet contraction functions form identifiable subclasses of the safe contraction functions, over any theory finite modulo logical equivalence. In the process of constructing the map, as the composition of four simple transformations, mediating notions of bottom and top contraction are introduced. The study of the infinite case remains open
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00373274
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 54,431
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

Add more references

Citations of this work BETA

Kernel Contraction.Sven Ove Hansson - 1994 - Journal of Symbolic Logic 59 (3):845-859.
Preferential Belief Change Using Generalized Epistemic Entrenchment.Hans Rott - 1992 - Journal of Logic, Language and Information 1 (1):45-78.
New Operators for Theory Change.Svenove Hansson - 1989 - Theoria 55 (2):114-132.

View all 12 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
60 ( #161,327 of 2,371,809 )

Recent downloads (6 months)
1 ( #557,530 of 2,371,809 )

How can I increase my downloads?

Downloads

My notes