Studia Logica 76 (3):427-442 (2004)

Allard Tamminga
University of Greifswald
We present a theory that copes with the dynamics of inconsistent information. A method is set forth to represent possibly inconsistent information by a finite state. Next, finite operations for expansion and contraction of finite states are given. No extra-logical element — a choice function or an ordering over (sets of) sentences — is presupposed in the definition of contraction. Moreover, expansion and contraction are each other's duals. AGM-style characterizations of these operations follow.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.1023/B:STUD.0000032106.55407.c8
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: 59,759
Through your library

References found in this work BETA

Theory Contraction Through Base Contraction.André Fuhrmann - 1991 - Journal of Philosophical Logic 20 (2):175 - 203.
On the Status of the Postulate of Recovery in the Logic of Theory Change.David Makinson - 1987 - Journal of Philosophical Logic 16 (4):383 - 394.
Reversing the Levi Identity.Sven Ove Hansson - 1993 - Journal of Philosophical Logic 22 (6):637 - 669.

View all 11 references / Add more references

Citations of this work BETA

Katz’s Revisability Paradox Dissolved.Allard Tamminga & Sander Verhaegh - 2013 - Australasian Journal of Philosophy 91 (4):771-784.

Add more citations

Similar books and articles


Added to PP index

Total views
82 ( #126,220 of 2,432,580 )

Recent downloads (6 months)
1 ( #464,745 of 2,432,580 )

How can I increase my downloads?


My notes