H. B. Smith on modality: A logical reconstruction (Q1098835): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Wolfgang Lenzen / rank | |||
Property / reviewed by | |||
Property / reviewed by: Wolfgang Lenzen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3867808 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5801329 / rank | |||
Normal rank |
Latest revision as of 14:56, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | H. B. Smith on modality: A logical reconstruction |
scientific article |
Statements
H. B. Smith on modality: A logical reconstruction (English)
0 references
1987
0 references
This paper offers a reconstruction of some ideas of H. B. Smith on the logic of (alethic) modalities developed in the mid-30's. Smith's main assumptions are (A) that any two positive modalities \(\Gamma\), \(\Delta\) (i.e. any strings of modal operators \(\square\), \(\diamond)\) are comparable in the sense that either \(\Gamma\) p entails \(\Delta\) p or vice versa; and (B) that no two different modalities are equivalent in the sense of \(\Gamma\) entailing \(\Delta\) and \(\Delta\) entailing \(\Gamma\). It is shown that (A) and (B) can be realized within a non-normal system (called \(K+SM)\) which is obtained by adding to the (normal) basic system K the axiom schemas \(p\supset \square^ n\diamond p\) (n\(\geq 0)\). (The non-normality is due to the fact that the rule of necessitation is restricted to the theorems of K; if necessitation were unrestrictedly valid in \(K+SM\), the resulting system would be equivalent to S5). A semantics is developed with respect to which \(K+SM\) can be proved to be complete.
0 references
modal logic
0 references
semantics
0 references