Distributive Minimization Comprehensions and the Polynomial Hierarchy
Category Theory
2017-03-29 v1 Logic in Computer Science
Abstract
A categorical point of view about minimization in subrecursive classes is presented by extending the concept of Symmetric Monoidal Comprehension to that of Distributive Minimization Comprehension. This is achieved by endowing the former with coproducts and a finality condition for coalgebras over the endofunctor sending X to to perform a safe minimization operator. By relying on the characterization given by Bellantoni, a tiered structure is presented from which one can obtain the levels of the Polytime Hierarchy as those classes of partial functions obtained after a certain number of minimizations.
Cite
@article{arxiv.1703.09328,
title = {Distributive Minimization Comprehensions and the Polynomial Hierarchy},
author = {Joaquín Díaz Boils},
journal= {arXiv preprint arXiv:1703.09328},
year = {2017}
}