doi abstract bibtex

Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that restricts its use to cases in which the premiss does not depend on assumptions. This restriction is entirely analogous to the restriction of the rule of universal generalization of first-order logic. A necessitation rule with this restriction permits a proof of the deduction theorem in its usual formulation. Other suggestions presented in the literature to deal with the problem are reviewed, and the present solution is argued to be preferable to the other alternatives. A contraction- and cut-free sequent calculus equivalent to the Hilbert system for basic modal logic shows the standard failure argument untenable by proving the underivability of ◻A from A

@article{HakliNegriDDT, Author = {Hakli, Raul and Negri, Sara}, Date-Added = {2018-04-02 03:41:43 +0000}, Date-Modified = {2018-04-02 04:16:27 +0000}, Doi = {10.1007/s11229-011-9905-9}, Journal = {Synthese}, Number = {3}, Pages = {849--867}, Title = {Does the deduction theorem fail for modal logic?}, Volume = {187}, Year = {2012}, Abstract = {Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that restricts its use to cases in which the premiss does not depend on assumptions. This restriction is entirely analogous to the restriction of the rule of universal generalization of first-order logic. A necessitation rule with this restriction permits a proof of the deduction theorem in its usual formulation. Other suggestions presented in the literature to deal with the problem are reviewed, and the present solution is argued to be preferable to the other alternatives. A contraction- and cut-free sequent calculus equivalent to the Hilbert system for basic modal logic shows the standard failure argument untenable by proving the underivability of ◻A from A}, Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGJCVYJHZlcnNpb25YJG9iamVjdHNZJGFyY2hpdmVyVCR0b3ASAAGGoKgHCBMUFRYaIVUkbnVsbNMJCgsMDxJXTlMua2V5c1pOUy5vYmplY3RzViRjbGFzc6INDoACgAOiEBGABIAFgAdccmVsYXRpdmVQYXRoWWFsaWFzRGF0YV8QUC4uL1BhcGVycy9IYWtsaU5lZ3JpICgyMDEyKSBEb2VzIHRoZSBkZWR1Y3Rpb24gdGhlb3JlbSBmYWlsIGZvciBtb2RhbCBsb2dpYz8ucGRm0hcLGBlXTlMuZGF0YU8RAi4AAAAAAi4AAgAADE1hY2ludG9zaCBIRAAAAAAAAAAAAAAAAAAAAAAAAABCRAAB/////x9IYWtsaU5lZ3JpICgyMDEyKSAjRkZGRkZGRkYucGRmAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD/////AAAAAAAAAAAAAAAAAAEAAgAACiBjdQAAAAAAAAAAAAAAAAAGUGFwZXJzAAIAZC86VXNlcnM6YW5kcmV3OkRyb3Bib3g6UGFwZXJzOkhha2xpTmVncmkgKDIwMTIpIERvZXMgdGhlIGRlZHVjdGlvbiB0aGVvcmVtIGZhaWwgZm9yIG1vZGFsIGxvZ2ljPy5wZGYADgCOAEYASABhAGsAbABpAE4AZQBnAHIAaQAgACgAMgAwADEAMgApACAARABvAGUAcwAgAHQAaABlACAAZABlAGQAdQBjAHQAaQBvAG4AIAB0AGgAZQBvAHIAZQBtACAAZgBhAGkAbAAgAGYAbwByACAAbQBvAGQAYQBsACAAbABvAGcAaQBjAD8ALgBwAGQAZgAPABoADABNAGEAYwBpAG4AdABvAHMAaAAgAEgARAASAGJVc2Vycy9hbmRyZXcvRHJvcGJveC9QYXBlcnMvSGFrbGlOZWdyaSAoMjAxMikgRG9lcyB0aGUgZGVkdWN0aW9uIHRoZW9yZW0gZmFpbCBmb3IgbW9kYWwgbG9naWM/LnBkZgATAAEvAAAVAAIADf//AACABtIbHB0eWiRjbGFzc25hbWVYJGNsYXNzZXNdTlNNdXRhYmxlRGF0YaMdHyBWTlNEYXRhWE5TT2JqZWN00hscIiNcTlNEaWN0aW9uYXJ5oiIgXxAPTlNLZXllZEFyY2hpdmVy0SYnVHJvb3SAAQAIABEAGgAjAC0AMgA3AEAARgBNAFUAYABnAGoAbABuAHEAcwB1AHcAhACOAOEA5gDuAyADIgMnAzIDOwNJA00DVANdA2IDbwNyA4QDhwOMAAAAAAAAAgEAAAAAAAAAKAAAAAAAAAAAAAAAAAAAA44=}}

Downloads: 0