Expansion and contraction of finite states

Studia Logica 76 (3):427-442 (2004)
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
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,831
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

14 ( #179,916 of 1,724,750 )

Recent downloads (6 months)

1 ( #349,121 of 1,724,750 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.