English

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 nil\mathit{nil} and the operation cons\mathit{cons}, that adds an element to the front of a list. First we show that, for m1m \geq 1, quantifier-free mm-step induction does not simulate quantifier-free (m+1)(m + 1)-step induction. Secondly, we show that for all m1m \geq 1, quantifier-free mm-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}
}
R2 v1 2026-06-28T10:34:47.450Z