Maps between some different kinds of contraction function: the finite case (Q1089333): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3039305 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the logic of theory change: Partial meet contraction and revision functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the logic of theory change: safe contraction / rank | |||
Normal rank | |||
Latest revision as of 19:54, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maps between some different kinds of contraction function: the finite case |
scientific article |
Statements
Maps between some different kinds of contraction function: the finite case (English)
0 references
1986
0 references
A contraction of a theory A with respect to a proposition x is a subset of A that is closed under logical consequence and does not contain x. This paper compares different kinds of contraction functions, in particular partial meet contractions and safe contractions. It is known that every safe contraction function is a partial meet contraction function. In this paper it is shown that if the theory is finite, the converse also holds. Furthermore, this result is extended to some subclasses of partial meet contractions and safe contractions.
0 references
contraction of a theory
0 references
partial meet contractions
0 references
safe contractions
0 references
