Quantifier-Free Induction Schema and the Least Element Principle
Informatics and Automation, Mathematical logic and algebra, Tome 242 (2003), pp. 59-76
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider a quantifier-free induction schema and the least element principle in the language of elementary arithmetic enriched by a free function symbol $f$. Some stronger, iterated versions of these schemata are also considered. We show that the iterated induction schema does not prove the existence of a maximum of $f$ on every finite interval. A similar result is obtained for the noniterated least element principle. At the same time, already the doubly iterated least element principle for quantifier-free formulas proves the existence of a maximum of $f$. We also obtain additional results on the relationships between the two schemata, and outline their connections with the induction schema and the least element principle for decidable relations.
@article{TRSPY_2003_242_a4,
author = {L. D. Beklemishev},
title = {Quantifier-Free {Induction} {Schema} and the {Least} {Element} {Principle}},
journal = {Informatics and Automation},
pages = {59--76},
publisher = {mathdoc},
volume = {242},
year = {2003},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TRSPY_2003_242_a4/}
}
L. D. Beklemishev. Quantifier-Free Induction Schema and the Least Element Principle. Informatics and Automation, Mathematical logic and algebra, Tome 242 (2003), pp. 59-76. http://geodesic.mathdoc.fr/item/TRSPY_2003_242_a4/