Oxford University Press (OUP), Logic Journal of the IGPL, 6(18), p. 881-892
Full text: Download
We study straightforward embeddings of propositional normal multimodal logic and propositional intuitionistic logic in simple type theory. The correctness of these embeddings is easily shown. We give examples to demonstrate that these embeddings provide an effective framework for computational investigations of various non-classical logics. We report some experiments using the higher-order automated theorem prover LEO-II. © The Author 2010. Published by Oxford University Press. All rights reserved.