Logicality of Conditional Rewrite Systems
Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz,
and Aart Middeldorp
Proceedings of the 22nd Colloquium on Trees in Algebra and Programming
(CAAP 1997), Lecture Notes in Computer Science 1214, pp. 141 – 152,
1997
Abstract
A conditional term rewriting system is called logical if it has the same logical strength as the underlying conditional equational system. In this paper we summarize known logicality results and we present new sufficient conditions for logicality of the important class of oriented conditional term rewriting systems.BibTeX Entry
@inproceedings{YALSM-CAAP97,
author = "Toshiyuki Yamada and J{\"u}rgen Avenhaus and Carlos
Lor\'{\i}a-S\'aenz and Aart Middeldorp",
title = "Logicality of Conditional Rewrite Systems",
booktitle = "Proceedings of the 22nd Colloquium on Trees in Algebra and
Programming",
series = "Lecture Notes in Computer Science",
volume = 1214,
pages = "141--152",
year = 1997,
doi = "10.1007/BFb0030592"
}
© Springer