The Undecidability of Propositional Adaptive Logic

Authors: Horsten, Leon¹; Welch, Philip²

Source: Synthese, Volume 158, Number 1, September 2007 , pp. 41-60(20)

Publisher: Springer

Key:

- Free Content

- New Content

- Subscribed Content

- Free Trial Content

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 <EquationSource Format="TEX"><![CDATA[$$Sigma^0_3$$]]></EquationSource> -complete. These classifications are exact. For first order theories even finite sets of premises can generate such consequence sets in either calculus.

Keywords: Adaptive logic; Paraconsistent logic; Dynamic logic; Undecidability

Document Type: Research article

DOI: 10.1007/s11229-006-9049-5

Affiliations: 1: Email: Leon.Horsten@hiw.kuleuven.be 2: Email: p.welch@bristol.ac.uk

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$47.00 plus tax Refund Policy