The Gärdenfors impossibility theorem in non-monotonic contexts (Q917540): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Variations on the Ramsey test: More triviality results / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A logic for default reasoning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient reasoning about rich temporal domains / rank | |||
Normal rank |
Latest revision as of 10:04, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Gärdenfors impossibility theorem in non-monotonic contexts |
scientific article |
Statements
The Gärdenfors impossibility theorem in non-monotonic contexts (English)
0 references
1990
0 references
The Ramsey test says that a conditional sentence ``if A, then C'', is accepted in a state of belief K if and only if the minimal change of K needed to accept A also requires accepting C. Gärdenfors' impossibility theorem shows that the Ramsey test cannot be combined with some other weak conditions on belief revisions. The present note shows that a version of the impossibility theorem still can be proved even if the underlying logic is assumed to be nonmonotonic instead of classical.
0 references
nonmonotonic logic
0 references
Ramsey test
0 references
Gärdenfors' impossibility theorem
0 references
belief revisions
0 references