Author:
COQUAND THIERRY,HOFMANN MARTIN
Abstract
We use a syntactical notion of Kripke models to obtain interpretations of subsystems of
arithmetic in their intuitionistic counterparts. This yields, in particular, a new proof of Buss'
result that the Skolem functions of Bounded Arithmetic are polynomial time computable.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献