2.50
Hdl Handle:
http://hdl.handle.net/2173/96167
Title:
Combining time and knowledge, semantic approach
Authors:
Calardo, Erica; Rybakov, Vladimir V.
Citation:
Bulletin of the section of logic, 2005, vol. 34, no. 1, pp. 13-22
Publisher:
Uniwersytet Lodzki, Wydzial Logiki
Issue Date:
2005
URI:
http://hdl.handle.net/2173/96167
Additional Links:
http://www.filozof.uni.lodz.pl/bulletin
Abstract:
The paper investigates a semantic approach for combining knowledge and time. We introduce a multi-modal logic LF containing modalities for knowledge and time in a semantic way, as the set of all F-valid formulae for a class of special frames F. The main result of our paper is the theorem stating that LTK is decidable and giving a resolving algorithm. The result is proven by using standard tools: filtration, bulldozing and contracting p-morphisms.
Type:
Article
Language:
en
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.
ISSN:
0138-0680

Full metadata record

DC FieldValue Language
dc.contributor.authorCalardo, Ericaen
dc.contributor.authorRybakov, Vladimir V.en
dc.date.accessioned2010-04-09T13:38:07Z-
dc.date.available2010-04-09T13:38:07Z-
dc.date.issued2005-
dc.identifier.citationBulletin of the section of logic, 2005, vol. 34, no. 1, pp. 13-22en
dc.identifier.issn0138-0680-
dc.identifier.urihttp://hdl.handle.net/2173/96167-
dc.descriptionFull-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.en
dc.description.abstractThe paper investigates a semantic approach for combining knowledge and time. We introduce a multi-modal logic LF containing modalities for knowledge and time in a semantic way, as the set of all F-valid formulae for a class of special frames F. The main result of our paper is the theorem stating that LTK is decidable and giving a resolving algorithm. The result is proven by using standard tools: filtration, bulldozing and contracting p-morphisms.en
dc.language.isoenen
dc.publisherUniwersytet Lodzki, Wydzial Logikien
dc.relation.urlhttp://www.filozof.uni.lodz.pl/bulletinen
dc.titleCombining time and knowledge, semantic approachen
dc.typeArticleen
All Items in e-space are protected by copyright, with all rights reserved, unless otherwise indicated.