On a Generalised Logicality Theorem

Authors:
Marc Aiguier;Diane Bahrami;Catherine Dubois
Affiliations:
-;-;-
Venue:
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Year:
2002

Citing 6
Cited 2

Simplifying conditional term rewriting systems: Unification, termination and confluence

Journal of Symbolic Computation
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Free objects and equational deduction for partial conditional specifications

Theoretical Computer Science
Bi-rewrite systems

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
Logicality of conditional rewrite systems

Theoretical Computer Science - Trees in algebra and programming

Structures for Abstract Rewriting

Journal of Automated Reasoning
An Abstract Way to Define Rewriting Logic

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the correspondence between derivability (syntactic consequences obtained from 驴) and convertibility in rewriting (驴), the so-called logicality, is studied in a generic way (i.e. logic-independent). This is achieved by giving simple conditions to characterise logics where (bidirectional) rewriting can be applied. These conditions are based on a property defined on proof trees, that we call semi-commutation. Then, we show that the convertibility relation obtained via semi-commutation is equivalent to the inference relation 驴 of the logic under consideration.