Completeness and decidability results for some propositional modal logics containing “actually” operators

Journal of Philosophical Logic 30 (1):57-78 (2001)
  Copy   BIBTEX

Abstract

The addition of "actually" operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing "actually" operators has concentrated entirely upon extensions of KT5 and has employed a particular modeltheoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing "actually" operators, the weakest of which are conservative extensions of K, using a novel generalisation of the standard semantics

Author's Profile

Dominic Gregory
University of Sheffield

Analytics

Added to PP
2009-01-28

Downloads
169 (#77,469)

6 months
76 (#62,631)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?