Hybrid and Subexponential Linear Logics
Autor: | Joëlle Despeyroux, Carlos Olarte, Elaine Pimentel |
---|---|
Rok vydání: | 2017 |
Předmět: |
Discrete mathematics
Computation tree logic Theoretical computer science General Computer Science Interval temporal logic Linear logic 0102 computer and information sciences 02 engineering and technology Non-classical logic 01 natural sciences Theoretical Computer Science Logical framework Hybrid Linear Logic Linear temporal logic Temporal Logic 010201 computation theory & mathematics Subexponentials Many-valued logic Logical frameworks 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Temporal logic Mathematics |
Zdroj: | LSFA Repositório Institucional da UFRN Universidade Federal do Rio Grande do Norte (UFRN) instacron:UFRN |
ISSN: | 1571-0661 |
DOI: | 10.1016/j.entcs.2017.04.007 |
Popis: | HyLL (Hybrid Linear Logic) and SELL (Subexponential Linear Logic) are logical frameworks that have been extensively used for specifying systems that exhibit modalities such as temporal or spatial ones. Both frameworks have linear logic (LL) as a common ground and they admit (cut-free) complete focused proof systems. The difference between the two logics relies on the way modalities are handled. In HyLL, truth judgments are labelled by worlds and hybrid connectives relate worlds with formulas. In SELL, the linear logic exponentials (!, ?) are decorated with labels representing locations, and an ordering on such labels defines the provability relation among resources in those locations. It is well known that SELL, as a logical framework, is strictly more expressive than LL. However, so far, it was not clear whether HyLL is more expressive than LL and/or SELL. In this paper, we show an encoding of the HyLL's logical rules into LL with the highest level of adequacy, hence showing that HyLL is as expressive as LL. We also propose an encoding of HyLL into SELL ⋒ (SELL plus quantification over locations) that gives better insights about the meaning of worlds in HyLL. We conclude our expressiveness study by showing that previous attempts of encoding Computational Tree Logic (CTL) operators into HyLL cannot be extended to consider the whole set of temporal connectives. We show that a system of LL with fixed points is indeed needed to faithfully encode the behavior of such temporal operators. |
Databáze: | OpenAIRE |
Externí odkaz: |