Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification.

Saved in:

Bibliographic Details
Title:	Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification.
Authors:	RYBAKOV, V.¹ v.rybakov@mmu.ac.uk
Source:	Journal of Logic & Computation. Aug2008, Vol. 18 Issue 4, p509-519. 11p.
Subjects:	Mathematical logic, Combinatory logic, Logic machines, Nonclassical mathematical logic, Model theory, Set theory
Abstract:	The article studies multi-modal (in particular temporal, tense, logics) possessing universal formulas. We prove (Theorems 11 and 12) that the admissibility problem for inference rules (inference rules with parameters) is decidable for all decidable multi-modal (in particular, temporal) logics possessing an universal formula and decidable w.r.t. unification (unification with parameters). These theorems use characterizations of admissible rules in terms of valid rules and unifiable formulas. Results are applied to wide range of multi-modal logics, including all linear transitive temporal logics, all temporal logics with bounded zigzag, all multi-modal logics with explicit universal modality. As consequence, we show that the admissibility problem for all such logics is decidable (e.g. for all logics of the series S4nU, nϵN). [ABSTRACT FROM AUTHOR]
	Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	The article studies multi-modal (in particular temporal, tense, logics) possessing universal formulas. We prove (Theorems 11 and 12) that the admissibility problem for inference rules (inference rules with parameters) is decidable for all decidable multi-modal (in particular, temporal) logics possessing an universal formula and decidable w.r.t. unification (unification with parameters). These theorems use characterizations of admissible rules in terms of valid rules and unifiable formulas. Results are applied to wide range of multi-modal logics, including all linear transitive temporal logics, all temporal logics with bounded zigzag, all multi-modal logics with explicit universal modality. As consequence, we show that the admissibility problem for all such logics is decidable (e.g. for all logics of the series S4nU, nϵN). [ABSTRACT FROM AUTHOR]
ISSN:	0955792X