Synthese 158 (1):41-60 (2007)

Leon Horsten
Universität Konstanz
We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic is described. Our results show that taking the consequences of a decidable propositional theory is a complicated operation. The set of final consequences according to either the Reliability Calculus or the Minimal Abnormality Calculus of a decidable propositional premise set is in general undecidable, and can be -complete. These classifications are exact. For first order theories even finite sets of premises can generate such consequence sets in either calculus.
Keywords Philosophy   Philosophy of Language   Metaphysics   Epistemology   Logic   Philosophy
Categories (categorize this paper)
DOI 10.1007/s11229-006-9049-5
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: 65,579
Through your library

References found in this work BETA

The Logic of Reliable Inquiry.Kevin T. Kelly - 1996 - Oxford, England: Oxford University Press USA.
The Truth is Never Simple.John P. Burgess - 1986 - Journal of Symbolic Logic 51 (3):663-681.

View all 15 references / Add more references

Citations of this work BETA

View all 10 citations / Add more citations

Similar books and articles

Game Logic and its Applications I.Mamoru Kaneko & Takashi Nagashima - 1996 - Studia Logica 57 (2-3):325 - 354.
A Propositional Dynamic Logic with Qualitative Probabilities.Dimitar P. Guelev - 1999 - Journal of Philosophical Logic 28 (6):575-604.


Added to PP index

Total views
97 ( #114,196 of 2,461,817 )

Recent downloads (6 months)
1 ( #448,803 of 2,461,817 )

How can I increase my downloads?


My notes