Finitistic Properties of High Complexity
Logic
2017-07-19 v1
Abstract
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order arithmetical truth and beyond. Since the predicates are interpreted using properties of certain natural finite structures, they are arguably finitistic.
Cite
@article{arxiv.1707.05772,
title = {Finitistic Properties of High Complexity},
author = {Dmytro Taranovsky},
journal= {arXiv preprint arXiv:1707.05772},
year = {2017}
}
Comments
27 pages, original MathJax/html is in ancillary files