Abstract
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 \(\Sigma^0_3\)-complete. These classifications are exact. For first order theories even finite sets of premises can generate such consequence sets in either calculus.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Batens, D. (1995). Blocks: The clue to dynamic aspects of logic. Logique et Analyse, 150–152, 285–328.
Batens, D. (1999). Inconsistency-adaptive logics. In: (Orlowska, 1999, p. 445–472).
Batens D., Mortensen Ch., Priest G., Van Bendegem J.-P. (eds) (2000). Frontiers of paraconsistent logic. Research Studies Press, Baldock, UK
Batens, D. (2001). A general characterization of adaptive logics. Logique et Analyse, 173–175, 45–68
Batens, D. (2004). The need for adaptive logics in epistemology. In: (Rahman, 2004, p. 459–485).
Batens D. (2005). The theory of explanation generalized to include the inconsistent case. Synthese 143:63–88
Batens D. (2005). A procedural criterion for final derivability in inconsistency-adaptive logics. Journal of Applied Logic 3:221–250
Burgess J. (1986). The truth is never simple. Journal of Symbolic Logic 51:663–681
Gärdenfors P. (1988). Knowledge in flux Modeling the dynamics of epistemic states. MIT Press, Cambridge, MA
Kelly K. (1996). The logic of reliable inquiry. Oxford University Press, Oxford
Orlowska E. (1999). Logic at work Essays dedicated to the memory of Helena Rasiowa. Springer, Heidelberg, NY
Putnam H. (1965). Trial and error predicates and the solution to a problem of Mostowski. Journal of Symbolic logic 30:49–57
Rahman S. (eds) (2004). Logic, epistemology, and the unity of science. Kluwer, Dordrecht
Rogers H. (1968). Theory of recursive functions and effective computability. McGraw-Hill, NY
Sinaceur, H. (2000). Address at the Princeton University Bicentennial Conference on Problems in Mathematics (December 17–19, 1946), by Alfred Tarski. Bulletin of Symbolic Logic, 6, 1–44.
Urquhart A. (1984). The undecidability of entailment and relevant implication. Journal of Symbolic Logic 49:1059–1073
Weber, S. (2000). Mathematical analysis of priest’s nonmonotonic version of Kleene’s SK3. In: (Batens et al., 2000, p. 299–314).
Author information
Authors and Affiliations
Corresponding author
Additional information
An erratum to this article is available at http://dx.doi.org/10.1007/s11229-009-9496-x.
Rights and permissions
About this article
Cite this article
Horsten, L., Welch, P. The Undecidability of Propositional Adaptive Logic. Synthese 158, 41–60 (2007). https://doi.org/10.1007/s11229-006-9049-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11229-006-9049-5