A study in the logic of theory change, examining the properties of maxichoice contraction and revision operations.

The AGM theory of belief contraction is extended tomultiple contraction, i.e. to contraction by a set of sentences rather than by a single sentence. There are two major variants: Inpackage contraction all the sentences must be removed from the belief set, whereas inchoice contraction it is sufficient that at least one of them is removed. Constructions of both types of multiple contraction are offered and axiomatically characterized. Neither package nor choice contraction can in general be reduced to contractions by single (...) sentences; in the finite case choice contraction allows for reduction. (shrink)

Specified meet contraction is the operation defined by the identity where ∼ is full meet contraction and f is a sentential selector, a function from sentences to sentences. With suitable conditions on the sentential selector, specified meet contraction coincides with the partial meet contractions that yield a finite-based contraction outcome if the original belief set is finite-based. In terms of cognitive realism, specified meet contraction has an advantage over partial meet contraction in that the selection mechanism operates on sentences rather (...) than on temporary infinite structures (remainders) that are cognitively inaccessible. Specified meet contraction provides a versatile framework in which other types of contraction, such as severe withdrawal and base-generated contraction, can be expressed with suitably chosen properties of the sentential selector. (shrink)

It was shown that finite P-recovery holds for partial meet package contraction in Furhmann and Hansson (1994). However, it is not known if recovery holds for partial meet package contraction in the infinite case. In this paper, I show that recovery does not hold for partial meet package contraction in the infinite case.

Full meet contraction, that was devised by Carlos Alchourrón and David Makinson in the early 1980' s, has often been overlooked since it is not in itself a plausible contraction operator. However, it is a highly useful building-block in the construction of composite contraction operators. In particular, all plausible contraction operators can be reconstructed so that the outcome of contracting a belief set K by a sentence p is defined as K ∼ f, where ∼ is full meet contraction and (...) f a sentential selector, i.e. a function to and from sentences. This paper investigates the logic of full meet contraction. Seven properties of this operation are presented that contribute to making it useful as a building-block: Full meet contraction is a purely logical operation. It retains finitebasedness of the belief set. It is the inclusion-maximal contraction that removes all sentences that can contribute to implying the input sentence. It is the inclusion-maximal contraction that removes all non-tautologous consequences of the input sentence. Almost all contractions can be reconstructed as full meet contraction. Full meet contraction allows for recovery of the input sentence. Full meet contraction provides a unified account of multiple and singleton contraction. La llamada full meet contraction, creada por Carlos Alchourrón y David Makinson en los comienzos de los ' 80, ha sido a menudo desestimada puesto que ella no constituye un operador de contracción plausible. De todas formas ella es altamente útil en la construcción de operadores de contracción compuestos. En particular, todos los operadores de contracción plausibles pueden ser reconstruidos de forma tal que la contracción de un conjunto de creencias K por una sentencia p sea definida como K ∼ f, donde ∼ es una full meet contraction y f un selector de sentencias, i.e., una función de sentencias a sentencias. En este trabajo investigamos la lógica de la full meet contraction. Se presentan siete propiedades de esta operación que contribuyen a hacerla útil como building-block: Full meet contraction es una operación puramente lógica. Ella retiene la finit- basednes del conjunto de creencias. Ella es la máxima-inclusiva de las contracciones que elimina todas las sentencias que pueden contribuir a implicar la input-sentence. Es la contracción maximal inclusiva que elimina todas las consecuencias no tautológicas de la input-sentence. Casi todas las contracciones pueden ser reconstruidas como full-meet contractions. Full meet contraction permite la recuperación de la input-sentence. Full meet contracción da cuenta en forma unificada de las contracciones múltiples y singulares. (shrink)

There are several areas in applied logic where deletion from databases is involved in one way or another:Belief contraction Triggers of the form ‘If condition then remove A’, which are extensively used in database management systemsResource considerations as in relevance and linear logics, where addition or removal of resource can affect provabilityFree logic and the like, where existence and non-existence of individuals affects quantification.All of these areas have certain logical difficulties relating to the removal of elements. These difficulties are normally (...) overcome by working on the meta-level. This paper offers a comprehensive model in which the various forms of removal are treated on the object level, i.e., as connectives of the object language. (shrink)