Cobham Recursive Set Functions and Weak Set Theories

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F17%3A00476044" target="_blank" >RIV/67985840:_____/17:00476044 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1142/9789813223523_0005" target="_blank" >http://dx.doi.org/10.1142/9789813223523_0005</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1142/9789813223523_0005" target="_blank" >10.1142/9789813223523_0005</a>

Result language
angličtina
Original language name
Cobham Recursive Set Functions and Weak Set Theories
Original language description
The Cobham recursive set functions (CRSF) provide a notion of polynomial time computation over general sets. In this paper, we determine a subtheory ... of Kripke-Platek set theory whose ...-definable functions are precisely CRSF. The theory ... is based on the ...-induction scheme for ...-formulas whose leading existential quantifier satisfies certain boundedness and uniqueness conditions. Dropping the uniqueness condition and adding the axiom of global choice results in a theory ... whose ...-definable functions are CRSFC, that is, CRSF relative to a global choice function C. We further show that the addition of global choice is conservative over certain local choice principles.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)