Quantifier-free induction for lists

05/15/2023
by   Stefan Hetzl, et al.
0

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 m ≥ 1, quantifier-free m-step induction does not simulate quantifier-free (m + 1)-step induction. Secondly, we show that for all m ≥ 1, quantifier-free m-step induction does not prove the right cancellation property of the concatenation operation on lists defined by left-recursion.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/17/2021

Induction and Skolemization in saturation theorem proving

We consider a typical integration of induction in saturation-based theor...
research
05/17/2021

(Deep) Induction Rules for GADTs

Deep data types are those that are defined in terms of other such data t...
research
01/27/2021

Deriving monadic quicksort (Declarative Pearl)

To demonstrate derivation of monadic programs, we present a specificatio...
research
01/25/2023

Multisets and Distributions

We give a lightweight alternative construction of Jacobs's distributive ...
research
03/22/2021

The Implications of the No-Free-Lunch Theorems for Meta-induction

The important recent book by G. Schurz appreciates that the no-free-lunc...
research
11/30/2021

Lists of Top Artists to Watch computed algorithmically

Lists of top artists to watch are periodically published by various art ...
research
06/09/2023

Positivity certificates for linear recurrences

We show that for solutions of linear recurrences with polynomial coeffic...

Please sign up or login with your details

Forgot password? Click here to reset