Taming logic

Marx, M. and Mikulas, Szabolcs and Nemeti, I. (1995) Taming logic. Journal of Logic, Language and Information 4 (3), pp. 207-226. ISSN 0925-8531.

Full text not available from this repository.

Official URL: https://doi.org/10.1007/BF01049413

Abstract

In this paper, we introduce a general technology, calledtaming, for finding well-behaved versions of well-investigated logics. Further, we state completeness, decidability, definability and interpolation results for a multimodal logic, calledarrow logic, with additional operators such as thedifference operator, andgraded modalities. Finally, we give a completeness proof for a strong version of arrow logic.

Metadata

Item Type:	Article
School:	School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User:	Sarah Hall
Date Deposited:	13 Jul 2021 14:51
Last Modified:	13 Jul 2021 14:51
URI:	https://eprints.bbk.ac.uk/id/eprint/45090

Statistics

Archive Staff Only (login required)

Edit/View Item