MMU Home | Prospectus | About MMU | A-Z Index | Contacts 
 


mmuch more
 
Search:
bullet
Browse
Collection All
bullet
bullet
bullet
bullet
bullet
Listed communities
bullet
bullet
bullet
bullet

espace at MMU > Faculties > Faculty of Science and Engineering > Department of Computing and Mathematics > Inference in discrete linear temporal logic

Please use this identifier to cite or link to this item: http://hdl.handle.net/2173/96168
    Del.icio.us     LinkedIn     Citeulike     Connotea     Facebook     Stumble it!

SFX Query

Title: Inference in discrete linear temporal logic
Authors: Rybakov, Vladimir V.
Citation: Rybakov, V.V., Inference in discrete linear temporal logic.
Issue Date: Mar-2005
URI: http://hdl.handle.net/2173/96168
Additional Links: http://www.uni-log.org/one2.html
http://www.uni-log.org/unilogabstract.pdf
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.
Type: Presentation
Meetings and Proceedings
Language: en
Description: Paper presented at First World Congress and School on Universal Logic in Montreux, March 26th - April 3rd 2005.
Appears in Collections: Department of Computing and Mathematics

Files in This Item:

There are no files associated with this item.



All Items in e-space are protected by copyright, with all rights reserved, unless otherwise indicated.

 

OR Logo Powered by Open Repository | Cookies
Valid XHTML 1.0!