http://hdl.handle.net/2173/31421 Wed, 19 Jun 2013 19:42:39 GMT 2013-06-19T19:42:39Z http://hdl.handle.net/2173/96179 Title: Logic of visibility, perception, and knowledge and admissible inference rules Authors: Golovanov, M. I.; Kosheleva, A. V.; Rybakov, Vladimir V. 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. Description: This metadata relates to an article accepted for publication in Logic Journal of Interest Group in Pure and Applied Logics following peer review. The definitive publisher-authenticated version vol. 13, no. 2, pp. 201-209 is available online at: http://jigpal.oxfordjournals.org/cgi/content/abstract/13/2/201 Tue, 01 Mar 2005 00:00:00 GMT http://hdl.handle.net/2173/96179 2005-03-01T00:00:00Z http://hdl.handle.net/2173/96170 Title: A note on globally admissible inference rules for modal and superintuitionistic logics Authors: Rimatski, V. V.; Rybakov, Vladimir V. Abstract: In this short note we consider globally admissible inference rules. A rule r is globally admissible in a logic L if r is admissible in all logics with the finite model property which extend L. Here we prove a reduction theorem: we show that, for any modal logic L extending K4, a rule r is globally admissible in L iff r is admissible in all tabular logics extending L. The similar result holds for superintuitionistic logics. Description: Full-text of this article is not available in this e-prints service. This article was originally published following peer-review in Bulletin of the Section of Logic, published by and copyright Uniwersytet Lodzki, Wydzial Logiki. Sat, 01 Jan 2005 00:00:00 GMT http://hdl.handle.net/2173/96170 2005-01-01T00:00:00Z http://hdl.handle.net/2173/96169 Title: Admissible inference rules in temporal linear logics based at integer numbers Authors: Rybakov, Vladimir V. Abstract: This research concerns rules admissible in temporal linear transitive and intransitive logics based on integer numbers. Description: Paper presented at 9th Asian Logic Conference in Novosibirsk, 16-19 August 2005. Full-text is available at http://www.ict.nsc.ru/ws/ALC-9/9092/Rybakov.pdf Mon, 01 Aug 2005 00:00:00 GMT http://hdl.handle.net/2173/96169 2005-08-01T00:00:00Z http://hdl.handle.net/2173/96168 Title: Inference in discrete linear temporal logic Authors: Rybakov, Vladimir V. Abstract: We study logical inference in terms of admissible consecutions (admissible inference rules) for the temporal linear logics. We start by a proof that even linear temporal logics do not enjoy finite model property. Main results of our research are: Theorem 1. The temporal logic DLTL of all integer numbers is decidable w.r.t. admissible inference rules. Theorem 2. The temporal logic L(cln) based on all natural numbers is decidable w.r.t. admissible inference rules. Description: Paper presented at First World Congress and School on Universal Logic in Montreux, March 26th - April 3rd 2005. Tue, 01 Mar 2005 00:00:00 GMT http://hdl.handle.net/2173/96168 2005-03-01T00:00:00Z