Logic of Visibility, Perception, and Knowledge and Admissible Inference Rules

Authors: Golovanov, M.I.; Kosheleva, A.V.; Rybakov, V.

Source: Logic Journal of the IGPL, Volume 13, Number 2, March 2005 , pp. 201-209(9)

Publisher: Oxford University Press

Key:

- Free Content

- New Content

- Subscribed Content

- Free Trial Content

Abstract:

We investigate admissible inference rules for the multi-modal logic VSK⁺ extending the logic VSK - the logic of Visibility, Perception and Knowledge. The logic VSK has been introduced by M.Wooldridge and A. Lomuscio [21]. VSK was intended for reasoning about properties of computational agents situated in some environment. Admissible rules are important for modelling of logical consequence. We consider these rules for VSK⁺, the logic of a wise agent (one which knows anything visible). The main result of our paper is the construction of an algorithm which determines admissible inference rules in VSK⁺. The algorithm is based on the proof of existence of computable bounds on the size of special Kripke 3-frames refuting inadmissible rules.

Keywords: Cut elimination, complexity of cut elimination, mo

Document Type: Research article

DOI: 10.1093/jigpal/jzi014

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$40.03 plus tax Refund Policy