The undecidability of propositional adaptive logic
Synthese 158 (1):41 - 60 (2007)
| 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 -complete. These classifications are exact. For first order theories even finite sets of premises can generate such consequence sets in either calculus. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAlexander Bochman & Dov M. Gabbay (2012). Sequential Dynamic Logic. Journal of Logic, Language and Information 21 (3):279-298.
Merlijn Sevenster (2006). On the Computational Consequences of Independence in Propositional Logic. Synthese 149 (2):257 - 283.
Michael J. Carroll (1976). On Interpreting the S5 Propositional Calculus: An Essay in Philosophical Logic. Dissertation, University of Iowa
Mauro Ferrari & Pierangelo Miglioli (1993). Counting the Maximal Intermediate Constructive Logics. Journal of Symbolic Logic 58 (4):1365-1401.
Douglas Cenzer & Jeffrey B. Remmel (2006). Complexity, Decidability and Completeness. Journal of Symbolic Logic 71 (2):399 - 424.
G. Aldo Antonelli & Richmond H. Thomason (2002). Representability in Second-Order Propositional Poly-Modal Logic. Journal of Symbolic Logic 67 (3):1039-1054.
Peter Verdée (2009). Adaptive Logics Using the Minimal Abnormality Strategy Are P 1 1 \Pi^1_1 -Complex. Synthese 167 (1):93 - 104.
Peter Verdée (2009). Adaptive Logics Using the Minimal Abnormality Strategy Are 1 \Pi^11 -Complex. Synthese 167 (1):93 - 104.
Leon Horsten & Philip Welch (2009). Erratum: The Undecidability of Propositional Adaptive Logic. Synthese 169 (1):217 - 218.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads13 ( #87,789 of 548,973 )Recent downloads (6 months)1 ( #63,511 of 548,973 )How can I increase my downloads? |
My notes
Discussion
