Rybakov, Vladimir V. (2005) Inference in discrete linear temporal logic. In: UNSPECIFIED. (Unpublished)Full text not available from this repository.
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.
|Item Type:||Conference or Workshop Item (UNSPECIFIED)|
|Additional Information:||Paper presented at First World Congress and School on Universal Logic in Montreux, March 26th - April 3rd 2005.|
|Divisions:||Faculties > Faculty of Science and Engineering > Department of Computing, Mathematics & Digital Technology|
|Date Deposited:||09 Apr 2010 13:39|
|Last Modified:||01 Sep 2016 14:00|
Actions (login required)