Sequence encoding without induction
Logic
2012-06-26 v1 Logic in Computer Science
Abstract
We show that the universally axiomatized, induction-free theory PA^- is a sequential theory in the sense of Pudl\'ak [5], in contrast to the closely related Robinson's arithmetic.
Cite
@article{arxiv.1201.5835,
title = {Sequence encoding without induction},
author = {Emil Jeřábek},
journal= {arXiv preprint arXiv:1201.5835},
year = {2012}
}
Comments
7 pages