Quantifier-free induction for lists
Logic
2023-05-16 v1 Logic in Computer Science
Abstract
We investigate quantifier-free induction for Lisp-like lists constructed inductively from the empty list and the operation , that adds an element to the front of a list. First we show that, for , quantifier-free -step induction does not simulate quantifier-free -step induction. Secondly, we show that for all , quantifier-free -step induction does not prove the right cancellation property of the concatenation operation on lists defined by left-recursion.
Cite
@article{arxiv.2305.08682,
title = {Quantifier-free induction for lists},
author = {Stefan Hetzl and Jannik Vierling},
journal= {arXiv preprint arXiv:2305.08682},
year = {2023}
}