Induction rules in bounded arithmetic

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F20%3A00523579" target="_blank" >RIV/67985840:_____/20:00523579 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007%2Fs00153-019-00702-w" target="_blank" >https://link.springer.com/article/10.1007%2Fs00153-019-00702-w</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00153-019-00702-w" target="_blank" >10.1007/s00153-019-00702-w</a>

Result language
angličtina
Original language name
Induction rules in bounded arithmetic
Original language description
We study variants of Buss's theories of bounded arithmetic axiomatized by induction schemes disallowing the use of parameters, and closely related induction inference rules. We put particular emphasis on Pi^b_i induction schemes, which were so far neglected in the literature. We present inclusions and conservation results between the systems (including a witnessing theorem for T^2_i and S^2_i of a new form), results on numbers of instances of the axioms or rules, connections to reflection principles for quantified propositional calculi, and separations between the systems.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)