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

@article{YALSM-TCS00,
 author    = "Toshiyuki Yamada and J{\"u}rgen Avenhaus and Carlos
              Lor\'{\i}a-S\'aenz and Aart Middeldorp",
 title     = "Logicality of Conditional Rewrite Systems",
 journal   = "Theoretical Computer Science",
 volume    = 236,
 number    = "1-2",
 pages     = "209--232",
 year      = 2000,
 doi       = "10.1016/S0304-3975(99)00210-8"
}