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

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


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


Added to PP

95 (#155,607)

6 months
13 (#101,481)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dominic Gregory
University of Sheffield

References found in this work

Modal Logic: An Introduction.Brian F. Chellas - 1980 - New York: Cambridge University Press.
A New Introduction to Modal Logic.M. J. Cresswell & G. E. Hughes - 1996 - New York: Routledge. Edited by M. J. Cresswell.
An essay in classical modal logic.Krister Segerberg - 1971 - Uppsala,: Filosofiska föreningen och Filosofiska institutionen vid Uppsala universitet.
A New Introduction to Modal Logic.G. E. Hughes & M. J. Cresswell - 1996 - Studia Logica 62 (3):439-441.

View all 10 references / Add more references