Multiple and iterated contraction reduced to single-step single-sentence contraction
type: Item
instance of: scholarly article
title: Multiple and iterated contraction reduced to single-step single-sentence contraction
zbMATH Open document ID: 1211.03028
author: Sven Ove Hansson
published in: Synthese
publication date: 2010-08-13T00:00:00Z
review text: Operations of `specified meet contraction' were introduced and studied by the author in his papers ``Contraction based on sentential selection'' [J. Log. Comput. 17, No.~3, 479--498 (2007; Zbl 1135.03008)] and ``Specified meet contraction'' [Erkenntnis 69, No.~1, 31--54 (2008; Zbl 1155.03010)]. The underlying idea is to use a function taking propositions to propositions to do some of the work of the selection operation in partial meet contraction: the specified meet contraction of proposition \(x\) from belief set \(K\) is defined to be the full meet contractions of \(f(x)\) from \(K\). In the paper under review, the author extends the scope of this notion to cover also multiple contraction, that is, the joint contraction of a collection (possibly infinite) of propositions from a belief set. Results obtained include sound and complete postulates for specified meet contraction from an arbitrary belief set closed under classical consequence, and also from finitely based such belief sets; the reduction of multiple specified meet contraction by a finite set to such contraction by a singleton; and the irreducibility in general of multiple specified meet contraction by an infinite set to the same by a finite set. Certain particular kinds of multiple specified meet contraction are also studied. The paper ends with some interesting reflections on why it may sometimes be better, in practice, to refrain from carrying out iterated contractions by single propositions, waiting instead for a suitable occasion to effect a multiple contraction covering a bundle of them.
reviewed by: David Makinson
Mathematics Subject Classification ID: 03B42
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T30
zbMATH DE Number: 5770279
zbMATH Keywords: specified meet contraction
zbMATH Keywords: multiple contraction
zbMATH Keywords: iterated contraction
zbMATH Keywords: full meet contraction
MaRDI profile type: Publication
full work available at URL: s11229-009-9688-4
OpenAlex ID: W1968841476
cites work: On the logic of theory change: Partial meet contraction and revision functions
cites work: Q3039305
cites work: Q4546697
cites work: Multiple kernel contraction
cites work: A survey of multiple contractions
cites work: Q3107917
cites work: New operators for theory change
cites work: A textbook of belief dynamics. Theory change and database updating
cites work: Contraction Based on Sentential Selection
cites work: Specified meet contraction
cites work: A note on partial meet package contraction
cites work: A paraconsistent theory of belief revision
cites work: Q4260405
cites work: Logic Programming and Nonmonotonic Reasoning
cites work: Infinitary belief revision
DOI: 10.1007/S11229-009-9688-4
Recommended article: Contraction Based on Sentential Selection
Recommended article: Theory Contraction and Base Contraction Unified
Recommended article: Decomposition of multiple AGM contraction: possibility and impossibility results
Recommended article: A survey of multiple contractions
Recommended article: Changes of disjunctively closed bases
Recommended article: Maximal and perimaximal contraction
Recommended article: Repertoire contraction
Recommended article: Global and iterated contraction and revision: an exploration of uniform and semi-uniform approaches
Recommended article: A model for structural changes of belief
Recommended article: Eradication
description: scientific article; zbMATH DE number 5770279