Unprovability results for clause set cycles
Logic in Computer Science
2022-08-05 v2
Abstract
The notion of clause set cycle abstracts a family of methods for automated inductive theorem proving based on the detection of cyclic dependencies between clause sets. By discerning the underlying logical features of clause set cycles, we are able to characterize clause set cycles by a logical theory. We make use of this characterization to provide practically relevant unprovability results for clause set cycles that exploit different logical features.
Cite
@article{arxiv.2110.03246,
title = {Unprovability results for clause set cycles},
author = {Stefan Hetzl and Jannik Vierling},
journal= {arXiv preprint arXiv:2110.03246},
year = {2022}
}
Comments
Revised version